A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable

DOI10.1007/s10878-014-9794-1zbMath1333.90141OpenAlexW252958960MaRDI QIDQ5963659

Qiaojun Shu, Zheng-Ke Miao, Dong Chen, Wei Fan Wang

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9794-1

zbMATH Keywords

treemaximum degree\((2,1)\)-total labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)

Cites Work

• The \((p,q)\)-total labeling problem for trees
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• Classification of regular embeddings of hypercubes of odd dimension
• (2,1)-total labelling of trees with sparse vertices of maximum degree
• \((2,1)\)-Total number of trees with maximum degree three
• On \((d,1)\)-total numbers of graphs
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs
• A bound on the chromatic number of the square of a planar graph
• The \(L(2,1)\)-labelling of trees
• (d,1)-total labeling of graphs with a given maximum average degree
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• Labelling Graphs with a Condition at Distance 2
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable