Large graphs with given degree and diameter. II
From MaRDI portal
Publication:793749
DOI10.1016/0095-8956(84)90012-1zbMath0539.05038OpenAlexW2006027480MaRDI QIDQ793749
Charles Delorme, Jean-Claude Bermond, Guy Farhi
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02426941/file/51-BDF81-degreediameter2.pdf
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (28)
Sufficient conditions for maximally connected dense graphs ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Fault diameter of product graphs ⋮ Large bipartite Cayley graphs of given degree and diameter ⋮ Hamilton-connectivity of interconnection networks modeled by a product of graphs ⋮ Tables of large graphs with given degree and diameter ⋮ Graphs of order two less than the Moore bound ⋮ Maximal cubic graphs with diameter 4 ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ The connectivity of generalized graph products ⋮ On large \((\Delta ,D)\)-graphs ⋮ Diameters of cubic graphs ⋮ Table of large \(({\Delta{}}, D)\)-graphs ⋮ ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS ⋮ Complete catalogue of graphs of maximum degree 3 and defect at most 4 ⋮ Vulnerability of super extra edge-connected graphs ⋮ On the unilateral (?,D*)-problem ⋮ Some new large (Δ, 3)‐graphs ⋮ New largest known graphs of diameter 6 ⋮ On super edge-connectivity of product graphs ⋮ On large (Δ, D, D, 1)-graphs ⋮ Matchings and covers in hypergraphs ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges ⋮ Multidiameters and multiplicities ⋮ A note on large graphs of diameter two and given maximum degree ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Asymptotically large (\(\Delta,D\))-graphs ⋮ Highly connected star product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tables of large graphs with given degree and diameter
- Large Graphs with Given Degree and Diameter—Part I
- Large Graphs with Given Degree and Diameter III
- Some New Results About the (d, k) Graph Problem
- Improved Construction Techniques for (d, k) Graphs
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
This page was built for publication: Large graphs with given degree and diameter. II
