Work

List-distance consistent vertices in trees are confined to a path

Year: 2026

Type: preprint

Abstract: A labeling of a connected graph $G$ on $n$ vertices is a bijection $c:V(G)\to\{1,\dots,n\}$; writing $c(u,v)=|c(u)-c(v)|$, a vertex $u$ is list-distance consistent if $d(u,v)

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.03803

Authors: Chang, Fei-Huang, Chia, Ma-Lian, Kuo, David, Lai, Guan-Ting

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science and Technology Council

OpenAlex ID: W7208755267

Cites:

Cited by:

Related to: 10