Tight just excellent graphs
Citation
Mudartha, I. K., Sundareswaran, R. & Swaminathan, V. (2019). Tight just excellent graphs. TWMS Journal of Applied and Engineering Mathematics, 9(2), 294-304.Abstract
A graph G is ?-excellent if for every vertex v, there exists a chromatic partition ? such that {v} ? ?.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 defined and studied.
Volume
9Issue
2URI
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2718http://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/410
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess
