𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions of small regular bipartite graphs of girth 6

✍ Scribed by G. Araujo-Pardo; Camino Balbuena

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
180 KB
Volume
57
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the bipartite density of regular grap
On the bipartite density of regular graphs with large girth
✍ OndΕ™ej ZΓ½ka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__β€–__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k β†’ ∞~ __b~k~__ β‰₯ 6/7.

Constructions of bipartite graphs from f
Constructions of bipartite graphs from finite geometries
✍ Keith E. Mellinger; Dhruv Mubayi πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 99 KB πŸ‘ 1 views

## Abstract We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These __n__ Γ— __n__ bipartite graphs provide constructions of __C__~6~‐free graphs with Ξ©(__n__^4/3^ edges

Tails of Bipartite Distance-regular Grap
Tails of Bipartite Distance-regular Graphs
✍ Michael S. Lang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 205 KB

Let denote a bipartite distance-regular graph with diameter D β‰₯ 4 and valency k β‰₯ 3. Let ΞΈ 0 > ΞΈ 1 > β€’ β€’ β€’ > ΞΈ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 ≀ s ≀ D -1) and abbreviate E := E s . We say E is a tail whenever the entry

Regular orientable embeddings of complet
Regular orientable embeddings of complete bipartite graphs
✍ Jin Ho Kwak; Young Soo Kwon πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com