A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
From MaRDI portal
Publication:1733738
DOI10.1016/j.amc.2016.06.048zbMath1410.05051OpenAlexW2470356309MaRDI QIDQ1733738
Yongtang Shi, Rongling Lang, Desen Mo, Tao Li
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.06.048
Related Items (9)
A Relation on Trees and the Topological Indices Based on Subgraph ⋮ More on spectral analysis of signed networks ⋮ The metric dimension of some generalized Petersen graphs ⋮ On edge-rupture degree of graphs ⋮ Network entropies based on independent sets and matchings ⋮ Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs ⋮ Maximizing Wiener index for trees with given vertex weight and degree sequences ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
Cites Work
- Bicyclic oriented graphs with skew-rank 2 or 4
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- On matching cover of graphs
- Extremality of degree-based graph entropies
- A history of graph entropy measures
- Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
- Hermitian Laplacian matrix and positive of mixed graphs
- Inferring to individual diversity promotes the cooperation in the spatial prisoner's dilemma game
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- Inertia of complex unit gain graphs
- Evolution of cooperation in the spatial public goods game with adaptive reputation assortment
- A characterization of PM-compact bipartite and near-bipartite graphs
- Fifty years of graph matching, network alignment and network comparison
- Signed graphs with small positive index of inertia
- Graph Energy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
