TIGHT JUST EXCELLENT GRAPHS

SR. I. K. MUDARTHA1, R. SUNDARESWARAN2, V. SWAMINATHAN3

[PDF]

Abstract

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 dened and studied.

Keywords