Irregular colorings of certain classes of corona product and Sierpiński graphs. (2nd January 2022)

• Record Type: Journal Article
• Authors: Iyer, Radha R.; Somamsundaram, K.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 25:Number 1(2022)
• Page Start: 97
• Page End: 105
• Publication Date: 2022-01-02
• Subjects: 05C15; Irregular colorings -- Corona product -- Sierpiński Graphs; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2021.2006264
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Let G be a simple connected graph. A coloring of G is said to be irregular if the vertices receives distinct color codes. The minimum number of color codes required to color the graph G is called the irregular chromatic number and it is denoted by χir ( G ). In this paper, we obtain the irregular coloring number for certain classes of corona product of graphs and Sierinski graphs.