On distinct distance sets in a graph

DOI10.1016/S0012-365X(96)00126-4zbMath0891.05028OpenAlexW2003008160MaRDI QIDQ1377770

Minghua Zhu, Yuansheng Yang, Zhengguo Yu, Chengxue Zhang, Xiao-hui Lin

Publication date: 7 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00126-4

zbMATH Keywords

diameterdistinct distance set

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cites Work

• Distinct distance sets in a graph
• A distinct distance set of 9 nodes in a tree of diameter 36

This page was built for publication: On distinct distance sets in a graph