TIGHT JUST EXCELLENT GRAPHS
A graph G is -excellent if for every vertex v, there exists a chromatic partition such that fvg 2 .A graph G is just -excellent if every vertex appears as a singleton in exactly one -partition. In this paper, a special type of just -excellence namely tight just -excellence is dened and studied.
___
- Fricke, G. H. , Teresa W. Haynes, Hetniemi,S. T. , Hedetniemi,S. M. and Laskar, R. C. (2002), Excellent trees, Bull. Inst. Combin. Appl.,34 pp.27-38.
- Sridharan,N. and Yamuna,M.,(1980), Excellent-Just Excellent-Very Excellent Graphs, Journal of Math. Phy.Sci., 14 (5), pp.471-475.
- Sampathkumar, E. and Bhave, V. N.,(1976), Partition Graphs and Colouring Numbers of a Graph, Discrete Mathematics, 16, pp.57-60.
- Sampathkumar, E. and Bhave, V. N., (1975), Partition Graphs of a Graph, Progress of Mathematics, 9(2), pp.33-42.
- Terasa W. Haynes, Stephen T. Hedetneimi, Peter J. Slater,(1998), Fundamentals of Domination in Graphs, Marcel Dekker Inc.
- ISSN: 2146-1147
- Başlangıç: 2010
- Yayıncı: Turkic World Mathematical Society
Sayıdaki Diğer Makaleler
T. M. ALİEV, E. A. IBAYEV, V. M. MAMEDOV
F. A. MUNTANER-BATLE, V. Vivin J., Venkatachalam M.