Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs
S. Prajnanaswaroopa, J. Geetha, K. Somasundaram

TL;DR
This paper determines the total, equitable total, and neighborhood sum distinguishing total chromatic numbers for certain classes of circulant graphs, advancing understanding of their coloring properties.
Contribution
It provides new results on the chromatic numbers for specific circulant graph classes, including equitable and neighborhood sum distinguishing variants.
Findings
Calculated total chromatic numbers for selected circulant graphs.
Established bounds for equitable total chromatic numbers.
Determined neighborhood sum distinguishing total chromatic numbers.
Abstract
In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems
