Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
DOI10.1016/J.AMC.2015.04.115zbMATH Open1410.05093OpenAlexW748691883MaRDI QIDQ668097FDOQ668097
Authors: Yongtang Shi, Matthias Dehmer, Marcel Moosbrugger 
Publication date: 18 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.2015.04.115
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Special matrices (15B99)
Cites Work
- Graph energy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph polynomials and their applications. I: The Tutte polynomial
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal matching energy of bicyclic graphs
- On the characteristic polynomial and the spectrum of a hexagonal system
- Randić matrix and Randić energy
- On some counting polynomials in chemistry
- Largest Hosoya index and smallest Merrifield-Simmons index in tricyclic graphs
- On Randić energy
- On the eigenvalues of trees
- Large-scale analysis of structural branching measures
- A note on the Randić spectral radius
- Title not available (Why is that?)
- On Randić energy
- A note on Randić energy
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- Title not available (Why is that?)
- Roots of cube polynomials of median graphs
- A zero-free interval for chromatic polynomials
- Hosoya polynomial of dendrimer nanostar \(D_3[n]\)
- Determination of Zhang-Zhang polynomials for various classes of benzenoid systems: non-heuristic approach
- On incidence energy
- On Randić spread
- Upper bounds for Randić spread
- Hosoya polynomials of hexagonal triangles and trapeziums
- Hosoya polynomials of circumcoronene series
Cited In (13)
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- On efficient network similarity measures
- Randić energy of specific graphs
- Highly unique network descriptors based on the roots of the permanental polynomial
- Graph descriptors from B-matrix representation
- On the degeneracy of the Randić entropy and related graph measures
- Generalized permanental polynomials of graphs
- Relations and bounds for the zeros of graph polynomials using vertex orbits
- A Relation on Trees and the Topological Indices Based on Subgraph
- Szeged and Mostar root-indices of graphs
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
This page was built for publication: Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668097)
