𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large regular bipartite graphs with median eigenvalue 1

✍ Scribed by Guo, Krystal; Mohar, Bojan

Book ID
122179896
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
256 KB
Volume
449
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite Distance-Regular Graphs with a
Bipartite Distance-Regular Graphs with an Eigenvalue of Multiplicity itk m
✍ Norio Yamazaki πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 194 KB

We show that, if a bipartite distance-regular graph of valency k has an eigenvalue of multiplicity k, then it becomes 2-homogeneous. Combined with a result on bipartite 2-homogeneous distance-regular graphs by K. Nomura, we have a classification of such graphs.

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.

Counting 1-Factors in Regular Bipartite
Counting 1-Factors in Regular Bipartite Graphs
✍ Alexander Schrijver πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 Γ‚k k&2 is l