Large graphs with given degree and diameter. II
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 3794103 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- Improved Construction Techniques for (d, k) Graphs
- Large Graphs with Given Degree and Diameter III
- Large Graphs with Given Degree and Diameter—Part I
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Some New Results About the (d, k) Graph Problem
- Tables of large graphs with given degree and diameter
Cited in
(50)- Highly connected star product graphs
- On large ( ,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
- scientific article; zbMATH DE number 861410 (Why is no real title available?)
- Hamilton-connectivity of interconnection networks modeled by a product of graphs
- Vulnerability of super extra edge-connected graphs
- Asymptotically large (\(\Delta,D\))-graphs
- Constructions of large graphs on surfaces
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Sufficient conditions for maximally connected dense graphs
- Examples of products giving large graphs with given degree and diameter
- Maximal cubic graphs with diameter 4
- Fault diameter of product graphs
- Large Graphs with Given Degree and Diameter—Part I
- Multidiameters and multiplicities
- On edge-connectivity and super edge-connectivity of interconnection networks modeled by product graphs
- Separation of Cartesian products of graphs on several connected components by the removal of edges
- Diameters of cubic graphs
- scientific article; zbMATH DE number 3939392 (Why is no real title available?)
- A note on large graphs of diameter two and given maximum degree
- The connectivity of generalized graph products
- Two new families of large compound graphs
- Matchings and covers in hypergraphs
- On the unilateral (?,D*)-problem
- Large circulant graphs of fixed diameter and arbitrary degree
- 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
- scientific article; zbMATH DE number 4014755 (Why is no real title available?)
- Degree diameter problem on silicate network
- On large \((\Delta , D, D, 1)\)-graphs
- scientific article; zbMATH DE number 7378741 (Why is no real title available?)
- Some new large (Δ, 3)‐graphs
- Graphs of order two less than the Moore bound
- Graphs with many large degrees
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- scientific article; zbMATH DE number 3891413 (Why is no real title available?)
- On super edge-connectivity of product graphs
- On the 3-restricted edge connectivity of permutation graphs
- New constructions of large scale planar networks with given diameter and maximum degree
- Tables of large graphs with given degree and diameter
- A note on the degree-diameter problem for arc-transitive graphs
- Degree diameter problem on triangular networks
- scientific article; zbMATH DE number 4059445 (Why is no real title available?)
- 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)
