Distances in graphs of girth 6 and generalised cages

DOI10.1016/j.dam.2021.02.006zbMath1459.05057OpenAlexW3132277452MaRDI QIDQ2656962

Alex Alochukwu, Peter Dankelmann

Publication date: 17 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.006

zbMATH Keywords

diametergirthminimum degreeradiuscagegeneralised cage

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (1)

On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On size, order, diameter and minimum degree
• The number of edges in a bipartite graph of given radius
• Diameter bounds for planar graphs
• A note on diameter and the degree sequence of a graph
• On size, order, diameter and edge-connectivity of graphs
• On diameter and inverse degree of a graph
• Minimum size of a graph or digraph of given radius
• Diameter of 4-colourable graphs
• Graphs of maximum diameter
• Radius, diameter, and minimum degree
• An upper bound for the radius of a 3-connected graph
• The radius of \(k\)-connected planar graphs with bounded faces
• Generalized cages
• Dynamic cage survey
• Diameter and inverse degree
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• Über ein Problem von K. Zarankiewicz
• The minimum order of n-connected n-regular graphs with specified diameters
• On the radius of neighborhood graphs
• Diameters in graphs

This page was built for publication: Distances in graphs of girth 6 and generalised cages