Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs

DOI10.1016/J.AKCEJ.2018.09.002MaRDI QIDQ5154566zbMATH OpenOpenAlexFDO

Authors Ashwini S. Yalnaik, Reza Sharafdini, Harishchandra S. Ramane

Publication date 5 October 2021

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1611.08270

zbMATH Keywords

distance in graphdistance-balanced graphsstatus indices

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: The status of a vertex $u$ in a connected graph $G$, denoted by $sigm{a}_G(u)$, is defined as the sum of the distances between $u$ and all other vertices of a graph $G$. The first and second status connectivity indices of a graph $G$ are defined as $S_1(G)=su{m}_{uvinE(G)}[sigm{a}_G(u)+sigm{a}_G(v)]$ and $S_2(G)=su{m}_{uvinE(G)}sigm{a}_G(u)sigm{a}_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 $overline{S}_1(G)=su{m}_{uvotinE(G)}[sigm{a}_G(u)+sigm{a}_G(v)]$ and $overline{S}_2(G)=su{m}_{uvotinE(G)}sigm{a}_G(u)sigm{a}_G(v)$ respectively. Relations between status connectivity indices and status coindices are established. Also these indices are computed for intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus.

Recommendations

• Computing status connectivity indices and its coindices of composite graphs
• scientific article; zbMATH DE number 7539962
• Status connectivity indices of line graphs
• scientific article; zbMATH DE number 7673535
• On the general sum-connectivity co-index of graphs
• On the connectivity of bipartite distance-balanced graphs
• Reciprocal status connectivity indices of graphs
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Several distance based indices for complement of graphs

Cites work

• Bipartite graphs with balanced (a,b)-partitions
• Computation of topological indices of some graphs
• Degree distance of unicyclic and bicyclic graphs
• Distance-balanced graphs
• Estimating the Wiener index by means of number of vertices, number of edges, and diameter
• Extremal graphs with respect to the Zagreb coindices
• Further properties of Zagreb indices
• Further properties on the degree distance of graphs
• scientific article; zbMATH DE number 5762976 (Why is no real title available?)
• scientific article; zbMATH DE number 1743972 (Why is no real title available?)
• scientific article; zbMATH DE number 2121251 (Why is no real title available?)
• scientific article; zbMATH DE number 2121253 (Why is no real title available?)
• scientific article; zbMATH DE number 6750341 (Why is no real title available?)
• scientific article; zbMATH DE number 6750355 (Why is no real title available?)
• On a conjecture about the Szeged index
• On the degree distance of a graph
• On the Wiener index of a graph
• On Zagreb indices and coindices
• Properties of connected graphs having minimum degree distance
• Some extremal properties of the degree distance of a graph
• Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons
• Strongly distance-balanced graphs and graph products
• The complexity of obtaining a distance-balanced graph
• The first and second Zagreb indices of some graph operations
• The minimum degree distance of graphs of given order and size
• The Zagreb coindices of graph operations
• Topological indices of the Kneser graph \(KG_{n,k}\)
• Unicyclic and bicyclic graphs having minimum degree distance
• Vertex-weighted Wiener polynomials for composite graphs
• Wiener index of trees: Theory and applications
• Zagreb indices of graphs

Cited in

(16)

• Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons
• \(VL\) reciprocal status index and co-index of graphs
• Status connectivity indices of line graphs
• Computing status connectivity indices and its coindices of composite graphs
• Richness of a vertex in a graph
• Reciprocal status connectivity indices of graphs
• Further results on Zagreb eccentricity coindices
• scientific article; zbMATH DE number 7539962 (Why is no real title available?)
• Status sum eigenvalues and energy of graphs
• scientific article; zbMATH DE number 7655728 (Why is no real title available?)
• scientific article; zbMATH DE number 7673535 (Why is no real title available?)
• Inverse sum indeg reciprocal status index and co-index of graphs
• Terminal status of vertices and terminal status connectivity indices of graphs with its applications to properties of cycloalkanes
• Upper bounds on the harmonic status index
• The status-temperature indices of graphs
• Further study on the second status connectivity index of graphs

This page was built for publication: Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154566)