Large graphs with given degree and diameter. II
From MaRDI portal
Publication:793749
DOI10.1016/0095-8956(84)90012-1zbMATH Open0539.05038OpenAlexW2006027480MaRDI QIDQ793749FDOQ793749
Authors: Jean-Claude Bermond, C. Delorme, 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
Recommendations
- Some large graphs with given degree and diameter
- Large Graphs with Given Degree and Diameter—Part I
- scientific article; zbMATH DE number 861410
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Large planar graphs with given diameter and maximum degree
- Large circulant graphs of fixed diameter and arbitrary degree
- A note on large graphs of diameter two and given maximum degree
- scientific article; zbMATH DE number 4014755
- scientific article; zbMATH DE number 4059445
- Graphs with diameter 2 and large total domination number
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- 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
- Title not available (Why is that?)
- Improved Construction Techniques for (d, k) Graphs
Cited In (49)
- Highly connected star product graphs
- On large \((\Delta ,D)\)-graphs
- Some large graphs with given degree and diameter
- Complete catalogue of graphs of maximum degree 3 and defect at most 4
- New largest known graphs of diameter 6
- Table of large \(({\Delta{}}, D)\)-graphs
- The degree-diameter problem for sparse graph classes
- Hamilton-connectivity of interconnection networks modeled by a product of graphs
- Vulnerability of super extra edge-connected graphs
- Asymptotically large (\(\Delta,D\))-graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Constructions of large graphs on surfaces
- Sufficient conditions for maximally connected dense graphs
- Examples of products giving large graphs with given degree and diameter
- Maximal cubic graphs with diameter 4
- Large Graphs with Given Degree and Diameter—Part I
- Fault diameter of product graphs
- On edge-connectivity and super edge-connectivity of interconnection networks modeled by product graphs
- Multidiameters and multiplicities
- Separation of Cartesian products of graphs on several connected components by the removal of edges
- Title not available (Why is that?)
- Diameters of cubic graphs
- A note on large graphs of diameter two and given maximum degree
- Two new families of large compound graphs
- The connectivity of generalized graph products
- On the unilateral (?,D*)-problem
- Large circulant graphs of fixed diameter and arbitrary degree
- Matchings and covers in hypergraphs
- Large bipartite Cayley graphs of given degree and diameter
- A survey on undirected circulant graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- Optimal graphs in the enhanced mesh networks
- Title not available (Why is that?)
- Degree diameter problem on silicate network
- On large \((\Delta , D, D, 1)\)-graphs
- Title not available (Why is that?)
- Some new large (Δ, 3)‐graphs
- Graphs with many large degrees
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Graphs of order two less than the Moore bound
- Title not available (Why is that?)
- New constructions of large scale planar networks with given diameter and maximum degree
- A note on the degree-diameter problem for arc-transitive graphs
- On super edge-connectivity of product graphs
- On the 3-restricted edge connectivity of permutation graphs
- Degree diameter problem on triangular networks
- Tables of large graphs with given degree and diameter
- Title not available (Why is that?)
- Graphs derived from perfect difference sets
This page was built for publication: Large graphs with given degree and diameter. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793749)
