Distinct distance sets in a graph

DOI10.1016/0012-365X(91)90251-VzbMath0755.05085MaRDI QIDQ1182889

Peter J. Slater, Richard A. Gibbs

Publication date: 28 June 1992

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

zbMATH Keywords

distancesbipartite graphscomplete graphslabellingsgrid graphsdistinct distance sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

On distinct distance sets in a graph ⋮ A distinct distance set of 9 nodes in a tree of diameter 36 ⋮ It Is All Labeling ⋮ Unnamed Item

Cites Work

• Odd Path Sums in an Edge-Labeled Tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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