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

DOI10.1016/J.DISC.2007.12.038zbMATH Open1160.05034OpenAlexW1969852661MaRDI QIDQ998400FDOQ998400

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

Recommendations

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

zbMATH Keywords

distanceboundary vertex

Mathematics Subject Classification ID

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

Cites Work

• Constructive lower bounds on classical multicolor Ramsey numbers
• Boundary vertices in graphs
• On geodetic sets formed by boundary vertices
• Title not available (Why is that?)
• Graphs with small boundary
• Some structural, metric and convex properties on the boundary of a graph

Cited In (5)

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

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)