The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular

DOI10.1016/0095-8956(77)90069-7zbMath0307.05103OpenAlexW1997857884MaRDI QIDQ1217712

Sukhamay Kundu

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90069-7

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On Moore Graphs with Diameters 2 and 3
• Which Graphs Have Unique Distance Trees?
• Unnamed Item
• Unnamed Item

This page was built for publication: The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular