Advanced search
Publication Cover
Journal of Discrete Mathematical Sciences and Cryptography Volume 25, 2022 - Issue 1
Journal homepage
13
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Irregular colorings of certain classes of corona product and Sierpiński graphs

Radha R. Iyer1 Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore641112, Tamil Nadu, India E-mail: [email protected]
&
K. Somamsundaram2 Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore641112, Tamil Nadu, IndiaCorrespondence[email protected]
Pages 97-105 | Received 01 Mar 2021, Published online: 10 Apr 2022

References

  • Radcliffe, Mary, and Ping Zhang. “Irregular colorings of graphs”, Bull. Inst. Combin. Appl, 49 (2007): 41-59.
  • Anderson, Mark, Richard P. Vitray, and Jay Yellen. “Irregular colorings of regular graphs”, Discrete Mathematics 312, no. 15 (2012): 2329-2336.
  • Rohini, A., and M. Venkatachalam. “On irregular colorings of triple star graph families”, Journal of Discrete Mathematical Sciences and Cryptography (2019): 22:6, 983-988.
  • Rohini, A., M. Venkatachalam, and R. Sangamithra. “Irregular colorings of derived graphs of flower graph”, SeMA Journal (2019): 1-11.
  • A. Rohini and M. Venkatachalam (2020), “Irregular colorings of friendship graph families”, Journal of Discrete Mathematical Sciences and Cryptography, 23:4, 913-924.
  • A.M. Hinz and D. Parisse, “Coloring Hanoi and Sierpiński graphs”, Discrete Mathematics (9) 312 (2012), 1521-1535.
  • M. Jakovac and S. Klavžar, “Vertex-, edge-, and total-colorings of Sierpiński-like graphs”, Discrete Mathematics, (6) 309 (2009) 1548-1556.
  • M. Jakovac, “A 2-parametric generalization of Sierpiński gasket graphs”, Ars Combinatoria, 116 (2014), 395-405.
  • Kang, Shin Min, Adnan Asghar, Haseeb Ahmad, and Young Chel Kwun, “Irregularity of Sierpinski graph”, Journal of Discrete Mathematical Sciences and Cryptography 22, no. 7 (2019): 1269-1280.
  • S. Klavžar and U. Milutinović , “Graphs S(n, k) and a variant of the Tower of Hanoi” problem, Czechoslovak Math. J. (122) 47 (1997), 95-104.
  • S. Gravier, M. Kovše and A. Parreau, “Generalized Sierpiński graphs”, Technical report, www.renyi.hu/conferences/ec11/posters/parreau. pdf (2011).
  • Geetha, J., and K. Somasundaram. “Total coloring for generalized Sierpinski graphs”, Australasian J. Combinatorics, 63 (2015): 58-69.
  • Mohan, S., J. Geetha, and K. Somasundaram. “Total coloring of corona product of two graphs.” Australas. J Comb. 68 (2017): 15-22.
  • Klavžar, Sandi, and Sara Sabrina Zemljič. “Connectivity and some other properties of generalized Sierpiński graphs.” Applicable Analysis and Discrete Mathematics, 12, no. 2 (2018): 401-412.
  • Vignesh, R, J Geetha, and K Somasundaram. “Total coloring conjecture for vertex, edge and neighborhood corona products of graphs.” Discrete Mathematics, Algorithms and Applications 11, no. 01 (2019): 1950014.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.