Equitable distinguishing chromatic number

Tayyebeh Amouzegar () and Kazem Khashyarmanesh ()
Additional contact information
Tayyebeh Amouzegar: Quchan University of Technology
Kazem Khashyarmanesh: Ferdowsi University of Mashhad

Indian Journal of Pure and Applied Mathematics, 2022, vol. 53, issue 2, 304-315

Abstract: Abstract We introduce the equitable distinguishing chromatic number $$\chi _{ED}(G)$$ χ ED ( G ) of a graph G as the least number k such that G has an equitable coloring with k colors that is only preserved by the trivial automorphism. The equitable distinguishing chromatic number of some graphs such as paths, cycles, trees, and Cartesian products of two complete graphs are determined.

Keywords: Distinguishing chromatic number; Graph automorphism; Equitable coloring; Equitable distinguishing chromatic number; 05C15; 05C25 (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-021-00004-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:53:y:2022:i:2:d:10.1007_s13226-021-00004-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-021-00004-z

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().