𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Amalgams of Cubic Bipartite Graphs

✍ Scribed by Domenico Labbate

Book ID
111579092
Publisher
Springer
Year
2004
Tongue
English
Weight
119 KB
Volume
32
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Det-extremal cubic bipartite graphs
Det-extremal cubic bipartite graphs
✍ M. Funk; Bill Jackson; D. Labbate; J. Sheehan πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

## Abstract Let __G__ be a connected __k__–regular bipartite graph with bipartition __V__(__G__) = __X__ βˆͺ __Y__ and adjacency matrix __A__. We say __G__ is det‐extremal if __per__ (__A__) = |__det__(A)|. Det–extremal __k__–regular bipartite graphs exist only for __k__ =  2 or 3. McCuaig has charac

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

Bipartite cubic graphs and a shortness e
Bipartite cubic graphs and a shortness exponent
✍ P.J. Owens πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 148 KB

The class of 3-connected bipartite cubic graphs is shown to contain a oon-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one. In this paper, a graph is a simple undirected gaph and a subgraph is an induced subgraph. For a~ay graph G, v(G) denotes the number of ve