Chromatic Excellence in Graphs
DOI:
https://doi.org/10.12723/mjs.19.5Abstract
Excellence in graphs introduced by G.H. Fricke is extended to partitions of the vertex set with respect to a parameter. A graph G is said to be Chromatic excellent if {v} appears in a chromatic partition of G for every vϵV(G). This paper is devoted to the study of chromatic excellence in graphs.References
G.H. Fricke, T. W. Haynes, S.T. Hedetniemi, S.M. Hedetniemi and R.C. Laskar. “Excellent trees,” Bulletin of the Institute of Combinatorics and its Applications, vol 34 pp 27-38. 2002
M.A. Henning and T.W. Haynes. “Total domination excellent trees.” Discrete Mathematics, vol. 263, pp 93-104, 2003.
T.W. Haynes and Michael A. Henning. “A characterization of i-excellent trees.” Discrete Mathematics, vol. 248, pp 69-77, 2002.
E. Sampathkumar. “Chromatically fixed, free and totally free vertices in a graph.” Journal of Combinatorics, Inforamtion and System Sciences, vol. 17, nos. 1-2, pp 130-138, 1992.
N. Sridharan and M. Yamuna. “Excellent-Just Excellent -Very Excellent Graphs.” Journal of Mathematics and Physical Sciences vol.14, no.5, pp. 471-475, 1980.
N. Sridharan and M. Yamuna. “A Note on Excellent graphs.” Ars Combinatoria, vol. 78, pp. 267-276, 2006.
M. Yamuna. “Excellent- Just Excellent -Very Excellent Graphs.” Ph. D Thesis, Alagappa University, India, 2003.
Published
Issue
Section
License
Copyright (c) 2011 Kulrekha Mudartha, R. Sundareswaran, V. Swaminathan
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
