scientific article
From MaRDI portal
Publication:3383645
DOI10.4418/2021.76.1.14zbMath1479.05068MaRDI QIDQ3383645
Publication date: 16 December 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
topological indexharmonic numberantiregular graphdistance-based topological indexvertex degree-based topological index
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Distance in graphs (05C12) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The harmonic index for graphs
- The Harary index of a graph
- On the symmetric division deg index of graph
- On Harary index of graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- On difference of Zagreb indices
- A note on the irregularity of graphs
- Inverse sum indeg index of graphs
- Spectral characterizations of anti-regular graphs
- Split graphs
- A formula with its applications on the difference of Zagreb indices of graphs
- On the reduced second Zagreb index of graphs
- On the inverse sum indeg index
- A forgotten topological index
- Note on the harmonic index of a graph
- On the independence polynomial of an antiregular graph
- Characteristic, admittance and matching polynomials of an antiregular graph
- On perfect and quasiperfect graphs
- Riordan matrices and sums of harmonic numbers
- M-Polynomial and Degree-Based Topological Indices
- A lower bound for the harmonic index of a graph with minimum degree at least two
- Zagreb polynomials of three graph operators
- Antiregular graphs are universal for trees
- No Graph is Perfect
- On connected graphs containing exactly two points of the same degree
This page was built for publication:
