Dergiler / TWMS Journal of Applied and Engineering Mathematics / 2019 / Cilt: 9 - Sayı: 2

TIGHT JUST EXCELLENT GRAPHS

Sr. I. K. MUDARTHA, R. SUNDARESWARAN, V. SWAMİNATHAN

Sayfa
294–304
DOI
—

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 dened and studied.