Distances in graphs of girth 6 and generalised cages
From MaRDI portal
Publication:2656962
Recommendations
Cites work
- A note on diameter and the degree sequence of a graph
- An upper bound for the radius of a 3-connected graph
- An upper bound on the radius of a 3-edge-connected graph
- Diameter and inverse degree
- Diameter bounds for planar graphs
- Diameter of 4-colourable graphs
- Diameters in graphs
- Dynamic cage survey
- Generalized cages
- Graphs of maximum diameter
- scientific article; zbMATH DE number 3763971 (Why is no real title available?)
- scientific article; zbMATH DE number 2188620 (Why is no real title available?)
- scientific article; zbMATH DE number 3255492 (Why is no real title available?)
- Minimum size of a graph or digraph of given radius
- On diameter and inverse degree of a graph
- On size, order, diameter and edge-connectivity of graphs
- On size, order, diameter and minimum degree
- On the radius of neighborhood graphs
- Order and radius of (2k-1)-connected graphs
- Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
- Radius, diameter, and minimum degree
- The minimum order of n-connected n-regular graphs with specified diameters
- The number of edges in a bipartite graph of given radius
- The radius of k-connected planar graphs with bounded faces
- Über ein Problem von K. Zarankiewicz
Cited in
(7)- Smith's theorem and a characterization of the 6-cube as distance-transitive graph
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
- Radius \(r\) extremal graphs of girth 5
- A diameter bound for 4-edge-connected C₄-free graphs
- Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
- The k-radius of 2-connected graphs
This page was built for publication: Distances in graphs of girth 6 and generalised cages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656962)