Lower bounding the boundary of a graph in terms of its maximum or minimum degree

DOI10.1016/j.disc.2007.12.038zbMath1160.05034OpenAlexW1969852661MaRDI QIDQ998400

Jean-Sébastien Sereni, Attila Pór, Tobias Müller

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.038

zbMATH Keywords

distanceboundary vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (2)

The boundary of a graph and its isoperimetric inequality ⋮ Strong resolving graphs: the realization and the characterization problems

Cites Work

• Unnamed Item
• On geodetic sets formed by boundary vertices
• Graphs with small boundary
• Boundary vertices in graphs
• Constructive lower bounds on classical multicolor Ramsey numbers
• Some structural, metric and convex properties on the boundary of a graph

This page was built for publication: Lower bounding the boundary of a graph in terms of its maximum or minimum degree