The inverse sum indeg index of graphs with some given parameters
From MaRDI portal
Publication:4603873
DOI10.1142/S1793830918500064zbMath1380.05104OpenAlexW2768986720MaRDI QIDQ4603873
Publication date: 23 February 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500064
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items
Inverse sum Indeg index and ISI matrix of graphs, SOME BOUNDS ON INVERSE SUM INDEG INDEX OF SOME GRAPH OPERATIONS, Upper bounds for the inverse sum indeg index of graphs, On two conjectures concerning trees with maximal inverse sum indeg index, On connected graphs and trees with maximal inverse sum indeg index, Inverse sum indeg reciprocal status index and co-index of graphs, On the variable inverse sum deg index: theory and applications, Linear and non-linear inequalities on the inverse sum indeg index, Some new upper bounds for the inverse sum indeg index of graphs, A note on the minimum inverse sum indeg index of cacti, A short note on inverse sum indeg index of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Some extremal graphs with respect to inverse degree
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Sharp bounds on the inverse sum indeg index
- Extremal properties of the bipartite vertex frustration of graphs
- The extremal values of some topological indices in bipartite graphs with a given matching number
- Extremal graphs with bounded vertex bipartiteness number
- On the monotonicity of topological indices and the connectivity of a graph
- On the inverse sum indeg index
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- Extremal topological indices for graphs of given connectivity
