On the ordering of distance-based invariants of graphs
From MaRDI portal
Publication:2423150
DOI10.1016/J.AMC.2017.12.015zbMATH Open1426.05032OpenAlexW2776934443MaRDI QIDQ2423150
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.12.015
Trees (05C05) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Trees with the seven smallest and eight greatest Harary indices
- The Laplacian spectral radii of trees with degree sequences
- Greedy trees, caterpillars, and Wiener-type graph invariants
- The Number of Subtrees of Trees with Given Degree Sequence
- Graph distance measures based on topological indices revisited
- On two eccentricity-based topological indices of graphs
- Properties of the Hyper-Wiener index as a local function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- The invariance principle for the total length of the nearest-neighbor graph
- Unified extremal results of topological indices and spectral invariants of graphs
- New distance-based graph invariants and relations among them
- Comparative study of distance-based graph invariants
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the ordering of distance-based invariants of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423150)
