Results 1 to 10 of about 2,302 (247)
On the distinguishing chromatic number of the Kronecker products of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Mojgan Afkhami, Kazem Khashyarmanesh
exaly +5 more sources
On the local distinguishing chromatic number [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 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
Omid Khormali
exaly +5 more sources
The distinguishing chromatic number of Cartesian products of two complete graphs [PDF]
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Janja Jerebic
exaly +4 more sources
Distinguishing chromatic number of random Cayley graphs [PDF]
Discrete Mathematics, 2017 11 ...
Sajith Padinhatteeri +1 more
exaly +5 more sources
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2022 The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V(G)→{1, 2, …, k} whose induced edge labels {c(u),c(v)} are distinct for all edges uv.
Grant Fickes, Wing Hong Tony Wong
doaj +4 more sources
The adjacent vertex distinguishing total chromatic number [PDF]
Discrete Mathematics, 2012 A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges receive different colours and every vertex and incident edge receive different colours.
Coker, Tom, Johannson, Karen R
exaly +6 more sources
The Distinguishing Number and Distinguishing Chromatic Number for Posets [PDF]
Order, 2021 23 pages, 4 ...
Ann Trenk, Karen L Collins, Trenk Ann N
exaly +4 more sources
Equitable distinguishing chromatic number
Indian Journal of Pure and Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazem Khashyarmanesh +1 more
exaly +2 more sources
The chromatic distinguishing index of certain graphs
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
exaly +2 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources