Abstract
The status of a vertex u, denoted by σG(u), is the sum of the distances between u and all other vertices in a graph G. The first and second status connectivity indices of a graph G are defined as S1(G)=∑uv∈E(G)[σG(u)+σG(v)] and S2(G)=∑uv∈E(G)σG(u)σG(v) respectively, where E(G) denotes the edge set of G. In this paper we have defined the first and second status co-indices of a graph G as S1¯(G)=∑uv∉E(G)[σG(u)+σG(v)] and S2¯(G)=∑uv∉E(G)σG(u)σG(v) respectively. Relations between status connectivity indices and status co-indices are established. Also these indices are computed for intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
