Inequalities between degree- and distance-based graph invariants
From MaRDI portal
(Redirected from Publication:1697635)
Recommendations
- Inequalities between vertex-degree-based topological indices
- Some topological indices of graphs and some inequalities
- Relations between distance-based and degree-based topological indices
- Graph distance measures based on topological indices revisited
- Some results on lower bounds for topological indices
Cites work
- scientific article; zbMATH DE number 6704639 (Why is no real title available?)
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 2141600 (Why is no real title available?)
- Bounds for the connective eccentric index
- Comparison between the Szeged index and the eccentric connectivity index
- Further inequalities between vertex-degree-based topological indices
- New bounds for randic and GA indices
- On eccentric connectivity index
- On the atom-bond connectivity index and radius of connected graphs
- On the eccentric connectivity index and Wiener index of a graph
- Relations between distance-based and degree-based topological indices
- Series expansion of the directed percolation probability
- Sharp bounds for the general sum-connectivity indices of transformation graphs
- Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
- Some lower and upper bounds on the third ABC index
- The Randić index and the diameter of graphs
- The relationship between the eccentric connectivity index and Zagreb indices
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
Cited in
(17)- Bounds for Some Distance-Based and Degree-Distance-Based Topological Indices
- Properties of graph distance measures by means of discrete inequalities
- The invariance principle for the total length of the nearest-neighbor graph
- Nordhaus-Gaddum type inequalities for some distance-based indices of bipartite molecular graphs
- New inequalities for network distance measures by using graph spectra
- The difference between several metric dimension graph invariants
- Comparative study of distance-based graph invariants
- Some inequalities on generalized degree based indices: an\( (a,b)\)-KA indices and coindices
- scientific article; zbMATH DE number 6750083 (Why is no real title available?)
- Some inequalities between degree- and distance-based topological indices
- Inequalities between vertex-degree-based topological indices
- scientific article; zbMATH DE number 7410901 (Why is no real title available?)
- scientific article; zbMATH DE number 1484045 (Why is no real title available?)
- On some degree-and-distance-based graph invariants of trees
- New distance-based graph invariants and relations among them
- Inequalities relating degrees of adjacent vertices to the average degree
- Some topological indices of graphs and some inequalities
This page was built for publication: Inequalities between degree- and distance-based graph invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697635)
