Eccentric connectivity coindex under graph operations
From MaRDI portal
Publication:2053266
DOI10.1007/S12190-019-01271-0zbMath1475.05048OpenAlexW2954231757MaRDI QIDQ2053266
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01271-0
Related Items (8)
A study of a new variant of the eccentric connectivity index for composite graphs ⋮ Eccentric connectivity coindex of bipartite graphs ⋮ On the eccentric connectivity index of \(k\)-uniform hyper-cacti ⋮ The sigma coindex of graph operations ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ General eccentric connectivity index of trees and unicyclic graphs ⋮ The effect of graph operations on the degree-based entropy ⋮ Further results on Zagreb eccentricity coindices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- Total eccentricity of some graph operations
- A note on hyper-Zagreb coindex of graph operations
- The Zagreb coindices of graph operations
- A lower bound on the eccentric connectivity index of a graph
- The generalized hierarchical product of graphs
- Topological efficiency under graph operations
- The hyper-Zagreb index and some graph operations
- The total eccentricity sum of non-adjacent vertex pairs in graphs
- Computing the eccentric-distance sum for graph operations
- The third and hyper-Zagreb coindices of some graph operations
- F-Index of some graph operations
- Vertex-weighted Wiener polynomials for composite graphs
- Further results on non-self-centrality measures of graphs
- Beyond the Zagreb indices
- The upper bounds for multiplicative sum Zagreb index of some graph operations
- Eccentric Connectivity Index of Chemical Trees
This page was built for publication: Eccentric connectivity coindex under graph operations
