Eccentric counts, connectivity and chordality

DOI10.1016/j.ipl.2012.08.022zbMath1259.05053OpenAlexW1973747265MaRDI QIDQ1941698

Henda C. Swart, Simon Mukwembi, Peter Dankelmann, David Erwin, Wayne Goddard

Publication date: 21 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.022

zbMATH Keywords

combinatorial problemsgraphsconnectivityeccentricitychordal graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• On eccentricity sequences of connected graphs
• Centers of triangulated graphs
• A simple relationship between the diameter and the radius of a graph
• Centers of chordal graphs
• Eccentric sequences in graphs
• Additive sparse spanners for graphs with bounded length of largest induced cycle
• Graph Classes: A Survey
• On the number of vertices with specified eccentricity

This page was built for publication: Eccentric counts, connectivity and chordality