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

DOI10.1016/J.DISC.2007.12.038MaRDI QIDQ998400zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Graphs with four boundary vertices
• Boundary vertices in graphs
• Boundary digraphs
• Graphs with small boundary
• Strict boundary vertices of a graph

Cites work

• scientific article; zbMATH DE number 2104812 (Why is no real title available?)
• Boundary vertices in graphs
• Constructive lower bounds on classical multicolor Ramsey numbers
• Graphs with small boundary
• On geodetic sets formed by boundary vertices
• Some structural, metric and convex properties on the boundary of a graph

Cited in

(5)

• The boundary of a graph and its isoperimetric inequality
• On the relationship between the diameter and the size of a boundary of a directed graph
• Graphs with four boundary vertices
• Vertex isoperimetric parameter of a computation graph
• Strong resolving graphs: the realization and the characterization problems

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

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