Indian Journal of Pure and Applied Mathematics, ( ISI ), Volume (53), No (2), Year (2021-6) , Pages (304-315)

Title : ( Equitable distinguishing chromatic number )

Authors: Tayyebeh Amouzegar , Kazem Khashyarmanesh ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote


We introduce the equitable distinguishing chromatic number X(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.


, Distinguishing chromatic number, Graph automorphism , Equitable coloring , Equitable distinguishing chromatic number
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

author = {Tayyebeh Amouzegar and Khashyarmanesh, Kazem},
title = {Equitable distinguishing chromatic number},
journal = {Indian Journal of Pure and Applied Mathematics},
year = {2021},
volume = {53},
number = {2},
month = {June},
issn = {0019-5588},
pages = {304--315},
numpages = {11},
keywords = {Distinguishing chromatic number; Graph automorphism ; Equitable coloring ;Equitable distinguishing chromatic number},


%0 Journal Article
%T Equitable distinguishing chromatic number
%A Tayyebeh Amouzegar
%A Khashyarmanesh, Kazem
%J Indian Journal of Pure and Applied Mathematics
%@ 0019-5588
%D 2021