Some structural, metric and convex properties on the boundary of a graph

DOI10.1016/j.endm.2006.06.036zbMath1202.05034OpenAlexW1984231187MaRDI QIDQ3439437

Carlos Seara, Carmen Hernando, Ignacio M. Pelayo, Mercè Mora

Publication date: 29 May 2007

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

Full work available at URL: http://hdl.handle.net/2117/20898

zbMATH Keywords

contourboundarymetric dimensiongraph convexityextreme set

Mathematics Subject Classification ID

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

Related Items (3)

Extending the metric dimension to graphs with missing edges ⋮ Geodeticity of the contour of chordal graphs ⋮ Lower bounding the boundary of a graph in terms of its maximum or minimum degree

Cites Work

• On geodetic sets formed by boundary vertices
• Convex sets in graphs. II: Minimal path convexity
• The geodetic number of a graph
• On the Steiner, geodetic and hull numbers of graphs
• Boundary vertices in graphs
• Geodeticity of the contour of chordal graphs
• Rebuilding convex sets in graphs
• Convexity in Graphs and Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some structural, metric and convex properties on the boundary of a graph