Publication Type : Journal Article
Publisher : AUSTRALASIAN JOURNAL OF COMBINATORICS, CENTRE DISCRETE MATHEMATICS & COMPUTING DEPT MATHEMATICS, UNIV QUEENSLAND, BRISBANE, QLD 4072, AUSTRALIA,
Source : AUSTRALASIAN JOURNAL OF COMBINATORICS, CENTRE DISCRETE MATHEMATICS & COMPUTING DEPT MATHEMATICS, UNIV QUEENSLAND, BRISBANE, QLD 4072, AUSTRALIA, Volume 68, Issue 1, p.15–22 (2017)
Url : https://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p015.pdf
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Verified : Yes
Year : 2017
Abstract : A total coloring of a graph is an assignment of colors to all the elements (vertices and edges) of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of the Behzad and Vizing conjecture on total coloring for the corona product of two graphs G and H, when H is a cycle, a complete graph or a bipartite graph.
Cite this Research Publication : S. Mohan, J. Geetha, and Dr. Somasundaram K., “Total coloring of the corona product of two graphs”, AUSTRALASIAN JOURNAL OF COMBINATORICS, vol. 68, no. 1, pp. 15–22, 2017.