Let G(V,E) be a simple undirected graph. The Inverse sum indeg index of a graph G is defined as where ds is the degree of the vertex s in G. The new idea of proper colourings in the Inverse sum indeg index graph has been proposed in this chapter. Some families of graphs such as cycle, generalized Petersen graph and complete graph which satisfies the condition of r–regular Inverse sum indeg index. The inequalities for the chromatic number related to Inverse sum indeg index are developed.
Author(s) Details:
E. Litta,
Cauvery College for Women (Autonomous), Tiruchirappalli – 620018,
India.
S. Narmadha,
PG and
Research Department of Mathematics, Cauvery College for Women (Autonomous),
Tiruchirappalli – 620018, India.
Please see the link here: https://stm.bookpi.org/RATMCS-V9/article/view/13327
No comments:
Post a Comment