Introduction to total chromatic vertex stress of graphs

Author(s): Johan Kok1,2
1Independent Mathematics Researcher, City of Tshwane, South Africa
2Visiting Faculty at CHRIST (Deemed to be a University), Bangalore, India.
Copyright © Johan Kok. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper introduces the new notion of total chromatic vertex stress of a graph. Results for certain tree families and other \(2\)-colorable graphs are presented. The notions of chromatically-stress stability and chromatically-stress regularity are also introduced. New research avenues are also proposed.

Keywords: Chromatic vertex stress; chromatic equivalent coloring; chromatically-stress stable; chromatically-stress regular