Title : ( Equitable distinguishing chromatic number )
Authors: Tayyebeh Amouzegar , Kazem Khashyarmanesh ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
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.
Keywords
, Distinguishing chromatic number, Graph automorphism , Equitable coloring , Equitable distinguishing chromatic number
@article{paperid:1088125,
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
