On the transmission-based graph topological indices
From MaRDI portal
Publication:5159710
Abstract: The distance between the vertices and of a connected graph is defined as the number of edges in a minimal path connecting them. The emph{transmission} of a vertex of is defined by . 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 . This is an efficient method of finding these indices especially when the automorphism group of has a few orbits on or .
Recommendations
Cites work
- A new geometric-arithmetic index
- A note on the irregularity of graphs
- A survey on comparing Zagreb indices
- Comparison of topological indices based on iterated `sum' versus `product' operations
- Computation of topological indices of some graphs
- Counting relations for general Zagreb indices
- Distance in graphs
- Distance spectra of graphs: a survey
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Eigenvalues and degree deviation in graphs
- Estimating the Wiener index by means of number of vertices, number of edges, and diameter
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5619543 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 809164 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 912429 (Why is no real title available?)
- scientific article; zbMATH DE number 1409213 (Why is no real title available?)
- scientific article; zbMATH DE number 6257133 (Why is no real title available?)
- Inequalities between vertex-degree-based topological indices
- Mean distance in a graph
- On a conjecture about the Szeged index
- On comparing Zagreb indices
- On distance-balanced graphs
- On general sum-connectivity index
- On the differences between Szeged and Wiener indices of graphs
- On the eccentric distance sum of graphs
- On the revised Szeged index
- On the sum-Balaban index
- Some new results on distance-based graph invariants
- Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons
- The harmonic index for graphs
- The Szeged and the Wiener index of graphs
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Topological indices of the Kneser graph \(KG_{n,k}\)
- Unicyclic and bicyclic graphs having minimum degree distance
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- Wiener index of trees: Theory and applications
Cited in
(12)- Mostar index
- \(VL\) reciprocal status index and co-index of graphs
- Peripherality in networks: theory and applications
- Mostar index: results and perspectives
- Transmission in H-naphtalenic nanosheet
- Two new topological indices based on graph adjacency matrix eigenvalues and eigenvectors
- Transmission-reciprocal transmission index and coindex of graphs
- scientific article; zbMATH DE number 7673541 (Why is no real title available?)
- Transmission and reciprocal transmission topological indices and co-indices of Indu-Bala products of graphs
- Generalized transmission neighbor indices: graph connectivity analysis and its chemical relevance
- Mostar index and bounded maximum degree
- A new measure for transmission irregularity extent of graphs
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)