On the connectivity and diameter of geodetic graphs

DOI10.1016/j.ejc.2023.103886arXiv2208.06324OpenAlexW4388838939MaRDI QIDQ6189693

Nathan Linial, Asaf Etgar

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.06324

zbMATH Keywords

self-centered graphsgeodetic block

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Geodetic blocks of diameter three
• Geodetic graphs of diameter two and some related structures
• Rewriting systems, plain groups, and geodetic graphs
• New proof of a characterization of geodetic graphs
• Even-hole-free graphs: A survey
• On planar geodetic graphs
• Geodetic graphs of diameter two
• Geodetic graphs of diameter two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the connectivity and diameter of geodetic graphs