✦ LIBER ✦

Extremal non-bipartite regular graphs of girth 4

✍ Scribed by Zhao Dong-fang

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 95 KB
Volume: 47
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90035-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal Regular Graphs with Prescribed

Extremal Regular Graphs with Prescribed Odd Girth

✍ G.H. Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 496 KB

The odd girth of a graph \(G\) gives the length of a shortest odd cycle in \(G\). Let \(f(k, g)\) denote the smallest \(n\) such that there exists a \(k\)-regular graph of order \(n\) and odd girth \(g\). It is known that \(f(k, g) \geqslant k g / 2\) and that \(f(k, g)=k g / 2\) if \(k\) is even. T

Constructions of small regular bipartite

Constructions of small regular bipartite graphs of girth 6

✍ G. Araujo-Pardo; Camino Balbuena 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

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.

Decompositions of regular bipartite grap

Decompositions of regular bipartite graphs

✍ Michael S. Jacobson; Miroslaw Truszczyński; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,

Distance-regular graphs with girth 3 or

Distance-regular graphs with girth 3 or 4: I

✍ Paul Terwilliger 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 913 KB

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