On the Sanskruti index of graphs
From MaRDI portal
Publication:2700158
DOI10.1007/s12190-022-01789-wOpenAlexW4295786000WikidataQ114221157 ScholiaQ114221157MaRDI QIDQ2700158
Sourav Mondal, Kinkar Chandra Das
Publication date: 20 April 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-022-01789-w
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Vertex degrees (05C07)
Related Items (1)
Uses Software
Cites Work
- New upper bounds on Zagreb indices
- Computing Sanskruti index of certain nanostructures
- Degree-based topological indices of hexagonal nanotubes
- Maximizing the sum of the squares of the degrees of a graph
- Augmented Zagreb index
- Some new lower bounds for augmented Zagreb index
- Novel neighbourhood redefined first and second Zagreb indices on carborundum structures
- Neighbors degree sum energy of graphs
- On atom-bond connectivity index of graphs
- Extremal values of vertex-degree-based topological indices over graphs
- On the harmonic index and the chromatic number of a graph
- Extremal unicyclic graphs with respect to the Sanskruti index
- On the extremal graphs for Second Zagreb Index with fixed number of vertices and cyclomatic number
- A lower bound for the harmonic index of a graph with minimum degree at least three
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Sanskruti index of graphs