Some large graphs with given degree and diameter
From MaRDI portal
Recommendations
- Large Graphs with Given Degree and Diameter—Part I
- Large graphs with given degree and diameter. II
- scientific article; zbMATH DE number 861410
- Large planar graphs with given diameter and maximum degree
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Large circulant graphs of fixed diameter and arbitrary degree
- scientific article; zbMATH DE number 4014755
- A note on large graphs of diameter two and given maximum degree
- Large vertex-transitive and Cayley graphs with given degree and diameter
- scientific article; zbMATH DE number 4059444
Cited in
(27)- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
- Table of large \(({\Delta{}}, D)\)-graphs
- Maximal cubic graphs with diameter 4
- An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power
- Construction of extremal mixed graphs of diameter two
- Asymptotically large (\(\Delta,D\))-graphs
- A family of graphs and the degree/diameter problem
- \(S\)-packing colorings of cubic graphs
- Large Graphs with Given Degree and Diameter—Part I
- scientific article; zbMATH DE number 3891413 (Why is no real title available?)
- scientific article; zbMATH DE number 5642607 (Why is no real title available?)
- Large circulant graphs of fixed diameter and arbitrary degree
- Packing colouring of some classes of cubic graphs
- The degree-diameter problem for sparse graph classes
- Graphs derived from perfect difference sets
- scientific article; zbMATH DE number 7378741 (Why is no real title available?)
- Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
- Packing chromatic number under local changes in a graph
- Some new large (Δ, 3)‐graphs
- Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power
- A note on the degree-diameter problem for arc-transitive graphs
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Graphs with many large degrees
- Nonexistence of certain cubic graphs with small diameters
- New results on the degree-diameter problem for undirected graphs
- Large graphs with given degree and diameter. II
- The minimal spectral radius of graphs with a given diameter
This page was built for publication: Some large graphs with given degree and diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720626)