On the local distinguishing chromatic number
Omid Khormali
AKCE International Journal of Graphs and Combinatorics · 2019
doi:10.1016/j.akcej.2018.01.007 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of graphs. The exact values of 1-local distinguishing chromatic number of several classes of graphs such as stars, complete graphs, complete bipartite graphs, Petersen graph, cycles and paths are computed. Moreover, several bounds for local distinguishing chromatic number are presented. Keywords: Distinguishing number, Local distinguishing number, Distinguishing chromatic number
Abstract licence: CC BY-NC-ND
References11
11 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.