A graph labeling problem

Luo, Tao; Yu, Leah

doi:10.2140/involve.2024.17.327

Download this article
	For screen
	For printing

Recent Issues

The Journal

About the journal

Ethics and policies

Peer-review process

Submission guidelines

ISSN 1944-4184 (online)

ISSN 1944-4176 (print)

Author index

To appear

Other MSP journals

A graph labeling problem

Tao Luo and Leah Yu

Vol. 17 (2024), No. 2, 327–335

DOI: 10.2140/involve.2024.17.327

Abstract

Several special types of Leech trees are investigated in this note. In particular, it is shown that there is no diameter- $3$ Leech tree of order $n \geq 7$ , and there are at most finitely many diameter- $4$ Leech trees. A result of Székely, Wang, and Zhang on maximum degree of a vertex in a Leech tree is also improved.

Keywords

graph labeling, Leech tree, Sidon sets

Mathematical Subject Classification

Primary: 05C05, 05C78, 11B83

Milestones

Received: 11 January 2023

Revised: 3 May 2023

Accepted: 5 May 2023

Published: 20 May 2024

Communicated by Kenneth S. Berenhaut

Authors

Tao Luo
Department of Mathematics City University of Hong Kong Kowloon Hong Kong

Leah Yu
Centerville High School Centerville, OH United States

Vol. 17, No. 2, 2024