The distinguishing chromatic numbers of triangulations on the sphere
The distinguishing chromatic numbers of triangulations on the sphereopenaire
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes [PDF]
Information Processing Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meirun Chen
exaly +7 more sources
Related searches:
Distinguishing Chromatic Number of Cartesian Products of Graphs
SIAM Journal on Discrete Mathematics, 2010The distinguishing chromatic number $\chi_{_D}(G)$ of a graph $G$ is the least integer $k$ such that there is a proper $k$-coloring of $G$ which is not preserved by any nontrivial automorphism of $G$. We study the distinguishing chromatic number of Cartesian products of graphs by focusing on how much it can exceed the trivial lower bound of the ...
Hemanshu Kaul, Stephen G Hartke
exaly +2 more sources
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs [PDF]
2016 IEEE First International Conference on Data Science in Cyberspace (DSC), 2016 Analyzing chromatic number in coloring problem is a tough topic in graph analysis. We focus on the basic theory for a particular type of chromatic number. This will give us insights on the basic topological structure guiding lots of networks in the coming trend of big data era.
Enqiang Zhu +4 more
openaire +2 more sources
Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael S. Cavers +2 more
exaly +3 more sources
Neighbor sum distinguishing total chromatic number of planar graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changqing Xu
exaly +3 more sources
Vertex Distinguishing Equitable Total Chromatic Number of Join Graph
Acta Mathematicae Applicatae Sinica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Zhi-Wen +2 more
exaly +2 more sources
Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changqing Xu
exaly +2 more sources
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3
Journal of Combinatorial Optimization, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiying Wang
exaly +2 more sources
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph [PDF]
Key Engineering Materials, 2011 A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v.
Zhi Wen Wang
openaire +2 more sources