𝔖 Bobbio Scriptorium
✦   LIBER   ✦

(2, 1)-Total Labeling of Trees with Maximum Degree 4

✍ Scribed by Haina Sun; Jinghong Liu

Book ID
113847407
Publisher
Elsevier
Year
2012
Tongue
English
Weight
140 KB
Volume
25
Category
Article
ISSN
1875-3892

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite labeling of trees with maximum
Bipartite labeling of trees with maximum degree three
✍ Bonnington, C. Paul; ?irοΏ½?, Jozef πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 3 views

Let T = (V, E) be a tree with a properly 2-colored vertex set. A bipartite labeling of T is a bijection Ο•: V β†’ {1, . . . , |V |} for which there exists a k such that whenever Ο•(u) ≀ k < Ο•(v), then u and v have different colors. The Ξ±-size Ξ±(T ) of the tree T is the maximum number of elements in the

(d,1)-total labeling of graphs with a gi
(d,1)-total labeling of graphs with a given maximum average degree
✍ MickaΓ«l Montassier; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views

## Abstract The (__d__,1)‐total number $\lambda \_{d}^{T}(G)$ of a graph __G__ is the width of the smallest range of integers that suffices to label the vertices and the edges of __G__ so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance

A note on the total chromatic number of
A note on the total chromatic number of Halin graphs with maximum degree 4
✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 210 KB

In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.