𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal resonance of cubic bipartite polyhedral graphs

✍ Scribed by Wai Chee Shiu; Heping Zhang; Saihua Liu

Publisher
Springer
Year
2010
Tongue
English
Weight
801 KB
Volume
48
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Inductive classes of bipartite cubic gra
Inductive classes of bipartite cubic graphs
✍ Vladimir Batagelj πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 269 KB

In the paper two (a local and an expanding) inductive definitions of the class of all simple connected bipartite cubic graphs are given. ## 0. ~n~~uction We shall use the notions and notations from [l, 31. An inductive definition of a class Cn(S?'; 9) is local iff for each rule from 9 the part of

Even polyhedral decompositions of cubic
Even polyhedral decompositions of cubic graphs
✍ M. Preissmann πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 136 KB

An even polyhedral decomposition of a finite cubic grap;'i G is defined a-, a sel of elem,:nlar~ cycles of even length ir~ G with the property that each edge of G lies in exactly two of them. l~" G has chromatic index three, then G has an e~en !polyhedral decomposition. We ~d~ow ~hat. contrary to a

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(

Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

Small maximal matchings of random cubic
Small maximal matchings of random cubic graphs
✍ H. Assiyatun; W. Duckworth πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 330 KB

## Abstract We consider the expected size of a smallest maximal matching of cubic graphs. Firstly, we present a randomized greedy algorithm for finding a small maximal matching of cubic graphs. We analyze the average‐case performance of this heuristic on random __n__‐vertex cubic graphs using diffe