Diameter, minimum degree and hyperbolicity constant in graphs

DOI10.1016/J.ENDM.2016.10.045MaRDI QIDQ510987zbMATH OpenOpenAlexFDO

Authors Verónica Hernández, D. Pestana, José M. Rodríguez

Publication date 14 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.10.045

zbMATH Keywords

diameterfinite graphsGromov hyperbolicityhyperbolicity constantminimum degree

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1420446
• On diameter and inverse degree of a graph
• Diameter and connectivity of finite simple graphs
• On the hyperbolicity constant in graphs
• Diameter of orientations of graphs with given minimum degree
• scientific article; zbMATH DE number 7587174
• Extremal Graph Theory for Metric Dimension and Diameter
• Extremal graph theory for metric dimension and diameter
• On the total distance and diameter of graphs
• On the hyperbolicity constant in graph minors

Cites work

• Characterization of Gromov hyperbolic short graphs
• Gromov hyperbolic spaces
• On the hyperbolicity of chordal graphs
• Radius, diameter, and minimum degree
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)

Cited in

(2)

• On a classical theorem on the diameter and minimum degree of a graph
• Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant

This page was built for publication: Diameter, minimum degree and hyperbolicity constant in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510987)