Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Equitable total coloring of F n ⋁ W n

Equitable total coloring of F n ⋁ W n The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Equitable total coloring of F n ⋁ W n

Loading next page...
 
/lp/springer-journals/equitable-total-coloring-of-f-n-w-n-g02CVyA0MM

References (8)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag GmbH
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-006-6031-4
Publisher site
See Article on Publisher Site

Abstract

The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Dec 11, 2008

There are no references for this article.