The largest distance between a vertex u and any other vertices of G is its eccentricity e(u). If the distance between u and v is equal to e, a vertex v is an eccentric vertex of vertex u. (u). A function colour: VN that gives an eccentric colouring to a graph G=(V,E) is colour: VN.
I for all u,vV,,,,,,,,,,,,,,,,,,,,,
(color(u)=color(v))⇒d(u,v)>color(u).
(ii) color(v)e for all vV (v).
The lowest number of colours for which it is possible to eccentrically colour G by colours is the eccentric chromatic number _eN for a graph G:
V1,2,..., e _e _e _e _e _e _e _e _e We looked at the eccentric colorability of a graph in respect to other features in this study. Simple undirected graphs with no multiple edges or self loops have been considered. In addition, the eccentric colorability of the lexicographic product of some special class of graphs has been considered.
Author (S) Details
Medha Itagi Huilgol
Department of Mathematics, Bangalore University, Central College Campus, Bangalore - 560 001, India.
View Book :- https://stm.bookpi.org/CTMCS-V9/article/view/3643
No comments:
Post a Comment