会议论文详细信息
14th International Conference on Science, Engineering and Technology | |
γ - Uniquely colorable graphs | |
自然科学;工业技术 | |
Yamuna, M.^1 ; Elakkiya, A.^1 | |
Department of Mathematics, School of Advanced Sciences, VIT University, Vellore | |
632014, India^1 | |
关键词: Chromatic number; Graph G; Uniquely colorable; | |
Others : https://iopscience.iop.org/article/10.1088/1757-899X/263/4/042115/pdf DOI : 10.1088/1757-899X/263/4/042115 |
|
来源: IOP | |
【 摘 要 】
A graph G = ( V, E ) is uniquely colorable if the chromatic number χ ( G ) = n and every n - coloring of G induces the same partition of V. In this paper, we introduce a new kind of graph called γ - uniquely colorable graphs. We obtain a necessary and sufficient condition for a graph to be γ - uniquely colorable graphs. We provide a constructive characterization of γ - uniquely colorable trees.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
γ - Uniquely colorable graphs | 587KB | download |