## Abstract We consider bipartite graphs of degree Δ≥2, diameter __D__=3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (Δ, 3, −2) ‐graphs. We prove the uniqueness of the known bipartite (3, 3, −2) ‐graph and bipartite (4, 3, −2)‐graph. We al
✦ LIBER ✦
On large bipartite graphs of diameter 3
✍ Scribed by Feria-Purón, Ramiro; Miller, Mirka; Pineda-Villavicencio, Guillermo
- Book ID
- 118275284
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 296 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On bipartite graphs of diameter 3 and de
✍
Charles Delorme; Leif K. Jørgensen; Mirka Miller; Guillermo Pineda-Villavicencio
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 213 KB
👁 1 views
Large bipartite graphs with given degree
✍
C. Delorme
📂
Article
📅
1985
🏛
John Wiley and Sons
🌐
English
⚖ 393 KB
👁 1 views
W e give constructions of bipartite graphs with maximum A, diameter D on B vertices. such :bat for every D 3 2 :he !im i nf , . . , B . A'"' = b,, > 0. W e also improve similar results on ordinary graphs, for example, w e prove that lim, , , N -A-." = 1 if D is 3 or 5. This is a partial answer to a
Large bipartite Cayley graphs of given d
✍
Tomáš Vetrík; Rinovia Simanjuntak; Edy Tri Baskoro
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 181 KB
Diameters of random bipartite graphs
✍
Béla Bollobás; Victor Klee
📂
Article
📅
1984
🏛
Springer-Verlag
🌐
English
⚖ 485 KB
The diameter of bipartite distance-regul
✍
Paul Terwilliger
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 272 KB
Diameter-vulnerability of large bipartit
✍
C. Padró; P. Morillo; E. Llobet
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 713 KB