A distinct distance set of 9 nodes in a tree of diameter 36 (Q1182890): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Another Tree Labelling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distinct distance sets in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Odd Path Sums in an Edge-Labeled Tree / rank | |||
Normal rank | |||
Latest revision as of 15:33, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A distinct distance set of 9 nodes in a tree of diameter 36 |
scientific article |
Statements
A distinct distance set of 9 nodes in a tree of diameter 36 (English)
0 references
28 June 1992
0 references
The author shows that conjecture 3 given in the paper ``Distinct distance sets in a graph'' by \textit{R. A. Gibbs} and \textit{P. J. Slater}, published in [Discrete Math. 93, No. 2/3, 155-165 (1991; see the review above)], is true.
0 references
distinct distance set
0 references
tree
0 references
