Studia Scientiarum Mathematicarum Hungarica
Volume/Issue:
Volume 62: Issue 1
Total Coloring of the Generalized Corona Product of Graphs
Authors:
T. Kavaskar Department of Mathematics, Central University of Tamil Nadu, Thiruvarur - 610 005, INDIA

Search for other papers by T. Kavaskar in
Current site
Google Scholar
PubMed Close
and
Sreelakshmi Sukumaran Department of Mathematics, Central University of Tamil Nadu, Thiruvarur - 610 005, INDIA

Search for other papers by Sreelakshmi Sukumaran in
Current site
Google Scholar
PubMed Close
Pages:
1–6
Online Publication Date:
17 Mar 2025
Publication Date:
09 Apr 2025
Article Category:
Research Article
DOI:
https://doi.org/10.1556/012.2025.04326
Keywords:
Total coloring conjecture; Generalized Corona Product
Restricted access

A long standing Total Coloring Conjecture (TCC) asserts that every graph is total colorable using its maximum degree plus two colors. A graph is type-1 (or type-2) if it has a total coloring using maximum degree plus one (or maximum degree plus two) colors. For a graph 𝐺 with 𝑚 vertices and for a family of graphs {𝐻1, 𝐻2, … , 𝐻𝑚}, denote G∘˜Λi=1mHi, the generalized corona product of 𝐺 and 𝐻1, 𝐻2, … , 𝐻𝑚. In this paper, we prove that the total chromatic number of G∘˜Λi=1mHi is the maximum of total chromatic number of 𝐺 and maximum degree of G∘˜Λi=1mHi∈ plus one. As an immediate consequence, we prove that G∘˜Λi=1mHi is type-1 when 𝐺 satisfies TCC and also the corona product of 𝐺 and 𝐻 is type-1 if 𝐺 satisfies TCC. This generalizes some results in (R. Vignesh. et. al. in Discrete Mathematics, Algorithms and Applications, 11(1): 2019) and all the results in (Mohan et. al. in Australian Journal of Combinatorics, 68(1): 15-22, 2017.)

  • [1]

    S. Barik and G. Sahoo. On the Laplacian spectra of some variants of corona. Linear Algebra Appl., 512:32–47, 2017.

  • [2]

    M. Basavaraju, L. S. Chandran, M. C. Francis, and A. Naskar. Weak total coloring conjecture and Hadwiger’s conjecture on total graphs. Electron. J. Combin., 31(1): article no. 1.4, 2024.

    • Search Google Scholar
    • Export Citation
  • [3]

    M. Behzad. Graphs and their chromatic numbers. PhD thesis, Michigan State University, 1965.

  • [4]

    M. Behzad, G. Chartrand, and J. K. Cooper, Jr. The colour numbers of complete graphs. J. London Math. Soc., 42:226–228, 1967.

  • [5]

    M. Chen, X. Guo, H. Li, and L. Zhang. Total chromatic number of generalized Mycielski graphs. Discrete Math., 334:48–51, 2014.

  • [6]

    A. R. Fiuj Laali, H. Haj Seyyed Javadi, and Dariush Kiani

  • [7]

    R. Frucht and F. Harary. On the corona of two graphs. Aequationes Math., 4:322–325, 1970.

  • [8]

    H. Furmańczyk and R. Zuazua. Equitable total coloring of corona of cubic graphs. Discussiones Mathematicae Graph Theory, 41(4):1147, 2021.

    • Search Google Scholar
    • Export Citation
  • [9]

    H. Furmańczyk and R. Zuazua. Adjacent vertex distinguishing total coloring of the corona product of graphs. arXiv, 23 Aug 2022. https://arxiv.org/abs/2208.10884.

    • Search Google Scholar
    • Export Citation
  • [10]

    Y. Hou and W.-C. Shiu. The spectrum of the edge corona of two graphs. Electron. J. Linear Algebra, 20:586–594, 2010.

  • [11]

    G. Indulal. The spectrum of neighborhood corona of graphs. Kragujevac J. Math., 35(3):493–500, 2011.

  • [12]

    T. Kavaskar and S. Sukumaran. Total coloring of some graph operations. In Algorithms and discrete applied mathematics, volume 14508 of Lecture Notes in Comput. Sci., pages 302–312. Springer, Cham, 2024.

    • Search Google Scholar
    • Export Citation
  • [13]

    X. Liu and P. Lu. Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae. Linear Algebra Appl., 438(8):3547–3559, 2013.

    • Search Google Scholar
    • Export Citation
  • [14]

    P. Lu, K. Gao, and Y. Wu. Signless Laplacian spectrum of a class of generalized corona and its application. Discrete Math. Algorithms Appl., 10(5):1850060, 12, 2018.

    • Search Google Scholar
    • Export Citation
  • [15]

    C. J. H. McDiarmid and A. Sánchez-Arroyo. Total colouring regular bipartite graphs is NP-hard. volume 124, pages 155–162. 1994. Graphs and combinatorics (Qawra, 1990).

    • Search Google Scholar
    • Export Citation
  • [16]

    S. Mohan, J. Geetha, and K. Somasundaram. Total coloring of the corona product of two graphs. Australas. J. Combin., 68:15–22, 2017.

  • [17]

    R. Rajkumar and M. Gayathri. Spectra of generalized corona of graphs constrained by vertex subsets. Matematiche (Catania), 76(1):175–205, 2021.

    • Search Google Scholar
    • Export Citation
  • [18]

    A. Sánchez-Arroyo. Determining the total colouring number is NP-hard. Discrete Math., 78(3):315–319, 1989.

  • [19]

    M. A. Seoud. Total chromatic numbers. Appl. Math. Lett., 5(6):37–39, 1992.

  • [20]

    R. Vignesh, J. Geetha, and K. Somasundaram. Total coloring conjecture for vertex, edge and neighborhood corona products of graphs. Discrete Math. Algorithms Appl., 11(1):1950014, 9, 2019.

    • Search Google Scholar
    • Export Citation
  • Collapse
  • Expand
Cover Studia Scientiarum Mathematicarum Hungarica
Studia Scientiarum Mathematicarum Hungarica
Print ISSN:
0081-6906
Online ISSN:
1588-2896

Editors in Chief

Gábor SIMONYI (Rényi Institute of Mathematics)
András STIPSICZ (Rényi Institute of Mathematics)
Géza TÓTH (Rényi Institute of Mathematics) 

Managing Editor

Gábor SÁGI (Rényi Institute of Mathematics)

Editorial Board

  • Imre BÁRÁNY (Rényi Institute of Mathematics)
  • Károly BÖRÖCZKY (Rényi Institute of Mathematics and Central European University)
  • Péter CSIKVÁRI (ELTE, Budapest) 
  • Joshua GREENE (Boston College)
  • Penny HAXELL (University of Waterloo)
  • Andreas HOLMSEN (Korea Advanced Institute of Science and Technology)
  • Ron HOLZMAN (Technion, Haifa)
  • Satoru IWATA (University of Tokyo)
  • Tibor JORDÁN (ELTE, Budapest)
  • Roy MESHULAM (Technion, Haifa)
  • Frédéric MEUNIER (École des Ponts ParisTech)
  • Márton NASZÓDI (ELTE, Budapest)
  • Eran NEVO (Hebrew University of Jerusalem)
  • János PACH (Rényi Institute of Mathematics)
  • Péter Pál PACH (BME, Budapest)
  • Andrew SUK (University of California, San Diego)
  • Zoltán SZABÓ (Princeton University)
  • Martin TANCER (Charles University, Prague)
  • Gábor TARDOS (Rényi Institute of Mathematics)
  • Paul WOLLAN (University of Rome "La Sapienza")

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA
Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333
E-mail: smh.studia@renyi.mta.hu

Indexing and Abstracting Services:

  • CABELLS Journalytics
  • CompuMath Citation Index
  • Essential Science Indicators
  • Mathematical Reviews
  • Science Citation Index Expanded (SciSearch)
  • SCOPUS
  • Zentralblatt MATH

2024  
Scopus  
CiteScore  
CiteScore rank  
SNIP  
Scimago  
SJR index 0.305
SJR Q rank Q3

2023  
Web of Science  
Journal Impact Factor 0.4
Rank by Impact Factor Q4 (Mathematics)
Journal Citation Indicator 0.49
Scopus  
CiteScore 1.3
CiteScore rank Q2 (General Mathematics)
SNIP 0.705
Scimago  
SJR index 0.239
SJR Q rank Q3

Studia Scientiarum Mathematicarum Hungarica
Publication Model Hybrid
Submission Fee none
Article Processing Charge 900 EUR/article (only for OA publications)
Printed Color Illustrations 40 EUR (or 10 000 HUF) + VAT / piece
Regional discounts on country of the funding agency World Bank Lower-middle-income economies: 50%
World Bank Low-income economies: 100%
Further Discounts Editorial Board / Advisory Board members: 50%
Corresponding authors, affiliated to an EISZ member institution subscribing to the journal package of Akadémiai Kiadó: 100%
Subscription fee 2025 Online subsscription: 796 EUR / 876 USD
Print + online subscription: 900 EUR / 988 USD
Subscription Information Online subscribers are entitled access to all back issues published by Akadémiai Kiadó for each title for the duration of the subscription, as well as Online First content for the subscribed content.
Purchase per Title Individual articles are sold on the displayed price.

Studia Scientiarum Mathematicarum Hungarica
Language English
French
German
Size B5
Year of
Foundation		 1966
Volumes
per Year		 1
Issues
per Year		 4
Founder Magyar Tudományos Akadémia  
Founder's
Address		 H-1051 Budapest, Hungary, Széchenyi István tér 9.
Publisher Akadémiai Kiadó
Publisher's
Address		 H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
Responsible
Publisher		 Chief Executive Officer, Akadémiai Kiadó
ISSN 0081-6906 (Print)
ISSN 1588-2896 (Online)

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Nov 2024 0 0 0
Dec 2024 0 0 0
Jan 2025 0 0 0
Feb 2025 0 0 0
Mar 2025 264 3 4
Apr 2025 156 5 5
May 2025 0 0 0