Skip to main content
SpringerLink
Log in

Equitable total coloring of F n ⋁ W n

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Behzad, M. Graphs and their chromatic numbers. Doctoral Thesis, Michigan State University, East Lansing, 1965

    Google Scholar 

  2. Bondy, J.A., Mutry, U.S.R. Graph theory with applications. Macmillan. Elsevier, London, New York, 1976

    Google Scholar 

  3. Chen, X.E., Zhang, Z.F. AVDTC number of generalized Halin graphs with maximum degree at least 6. Acte Mathematicae Application Sinica, 24(1): 55–58 (2008)

    Article  MATH  Google Scholar 

  4. Fu, H.L. Some results on equalized total coloring. Congressus Numerantium, 102: 111–119 (1994)

    MATH  MathSciNet  Google Scholar 

  5. Li, J.W., Zhang, Z.F., Chen, X.E., Sun, Y.R. A Note on adjacent strong edge coloring of K(n,m). Acte Mathematicae Application Sinica, 22(2): 273–276 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Vizing, V.G. On an estimate of chromatic class of a p-graph (Russian). Metody Diskret. Analiz., 3: 25–30 (1964)

    MathSciNet  Google Scholar 

  7. Zhang, Z.F., Wang, W.F., Bao, S., Li, J.W., Wang, Z.W., Wang, W.J. On the equitable total colorings of some join graphs. Journal of Information and Computational Science, 2(4): 829–834 (2005)

    Google Scholar 

  8. Zhang, Z.F., Zhang, J.X, Wang, J.F. The total chromatic number of some graph. Sciences Sinica (Series A), 31(12): 1434–1441 (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou, 730070, China

    Kun Gong & Zhong-fu Zhang

  2. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou, 730070, China

    Zhong-fu Zhang

  3. Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Bejing, 100190, China

    Jian-fang Wang

Authors
  1. Kun Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhong-fu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian-fang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhong-fu Zhang.

Additional information

Supported by the National Natural Science Foundation of China (No. 10771091).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gong, K., Zhang, Zf. & Wang, Jf. Equitable total coloring of F n ⋁ W n . Acta Math. Appl. Sin. Engl. Ser. 25, 83–86 (2009). https://doi.org/10.1007/s10255-006-6031-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-006-6031-4

Keywords

2000 MR Subject Classification

Search

Navigation