Vertex-degree-based topological indices over starlike trees
From MaRDI portal
Publication:2341709
DOI10.1016/j.dam.2014.12.021zbMath1311.05034OpenAlexW2030400156MaRDI QIDQ2341709
Clara Betancur, Juan Rada, Roberto Cruz
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.12.021
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (10)
On Extremal Sombor Indices of Chemical Graphs, and Beyond ⋮ Unnamed Item ⋮ Pharmacological Characteristics Analysis of Two Molecular Structures ⋮ Affine Transformation Based Ontology Sparse Vector Learning Algorithm ⋮ Unnamed Item ⋮ The minimum harmonic index for unicyclic graphs with given diameter ⋮ Constructing new families of transmission irregular graphs ⋮ Sombor index of trees with at most three branch vertices ⋮ On harmonic index and diameter of quasi-tree graphs ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The harmonic index for graphs
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Starlike trees are determined by their Laplacian spectrum
- Graphs cospectral with starlike trees
- On a novel connectivity index
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Higher order connectivity index of starlike trees
- Augmented Zagreb index
- On structure-sensitivity of degree-based topological indices
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- Matchings in starlike trees
- No starlike trees are cospectral
This page was built for publication: Vertex-degree-based topological indices over starlike trees
