Graphs with all diametral paths through distant central nodes

DOI10.1016/0895-7177(93)90250-3zbMath0788.05054OpenAlexW1965982109MaRDI QIDQ1310227

Fred Buckley, Martin Lewinter

Publication date: 16 January 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90250-3

zbMATH Keywords

centerdistanceextremal problemsradiusembedding problemsdiametral path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

Easy computation of eccentricity approximating trees ⋮ Center and its spectrum of almost all \(n\)-vertex graphs of given diameter

Cites Work

• Unique eccentric point graphs
• The starlike trees which span a hypercube
• The dissimilarity characteristic of Husimi trees
• Facility Location Problems
• One-legged caterpillars span hypercubes
• On graphs containing a given graph as center

This page was built for publication: Graphs with all diametral paths through distant central nodes