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

DOI10.1007/s10878-016-0021-0zbMath1367.05190OpenAlexW2469995597MaRDI QIDQ2359803

Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang

Publication date: 22 June 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-016-0021-0

zbMATH Keywords

maximum degree\((2, 1)\)-total labelling\((2, 1)\)-total number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Cites Work

• The \((p,q)\)-total labeling problem for trees
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
• \([r,s,t\)-colorings of graphs]
• (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 labeling of trees with large maximum degree
• \((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
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
• Unnamed Item

This page was built for publication: A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)