On the transmission-based graph topological indices

From MaRDI portal
Publication:5159710



Abstract: The distance d(u,v) between the vertices u and v of a connected graph G is defined as the number of edges in a minimal path connecting them. The emph{transmission} of a vertex v of G is defined by sigma(v)=sumlimitsuinV(G)d(v,u). In this article we aim to define some transmission-based topological indices. We obtain lower and upper bounds on these indices and characterize graphs for which these bounds are best possible. Finally, we find these indices for various graphs using the group of automorphisms of G. This is an efficient method of finding these indices especially when the automorphism group of G has a few orbits on V(G) or E(G).




Cites work









This page was built for publication: On the transmission-based graph topological indices

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