(2,1)-Total number of trees with maximum degree three

DOI10.1016/J.IPL.2009.03.027MaRDI QIDQ989489zbMATH OpenOpenAlexFDO

Authors Weifan Wang, D. Chen

Publication date 20 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.03.027

zbMATH Keywords

maximum degreecombinatorial problems\((2, 1)\)-total number of trees with \(\Delta = 3\)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• (2,1)-total labelling of trees with sparse vertices of maximum degree
• \((2,1)\)-total labeling of trees with large maximum degree
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3

Cites work

• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• (2,1)-total labelling of trees with sparse vertices of maximum degree
• (d,1)-total labeling of graphs with a given maximum average degree
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labelling Graphs with a Condition at Distance 2
• On \((d,1)\)-total numbers of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The (2,1)-total labelling of the product of two kinds of graphs
• The L(2,1)-labelling of trees
• \((2,1)\)-total labelling of outerplanar graphs
• (d,1)-total labelling of planar graphs with large girth and high maximum degree
• \((p,1)\)-total labelling of graphs
• \([r,s,t]\)-colorings of graphs

Cited in

(10)

• (2,1)-total labelling of trees with sparse vertices of maximum degree
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
• Facial \([r,s,t]\)-colorings of plane graphs
• Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees
• (2,1)-total labelling of planar graphs with large maximum degree
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
• The (p,q)-total labeling problem for trees
• (2,1)-total number of joins of paths and cycles
• \((2,1)\)-total labeling of trees with large maximum degree
• The (2,1)-total labeling of graphs with low maximum average degree

This page was built for publication: \((2,1)\)-Total number of trees with maximum degree three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989489)