Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
From MaRDI portal
(Redirected from Publication:668097)
Recommendations
Cites work
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 6704610 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 49554 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A note on Randić energy
- A note on the Randić spectral radius
- A zero-free interval for chromatic polynomials
- Determination of Zhang-Zhang polynomials for various classes of benzenoid systems: non-heuristic approach
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- Extremal matching energy of bicyclic graphs
- General Randić matrix and general randic energy
- Graph energy
- Graph polynomials and their applications. I: The Tutte polynomial
- Hosoya polynomial of dendrimer nanostar \(D_3[n]\)
- Hosoya polynomials of circumcoronene series
- Hosoya polynomials of hexagonal triangles and trapeziums
- Large-scale analysis of structural branching measures
- Largest Hosoya index and smallest Merrifield-Simmons index in tricyclic graphs
- On Randić energy
- On Randić energy
- On Randić spread
- On incidence energy
- On some counting polynomials in chemistry
- On the characteristic polynomial and the spectrum of a hexagonal system
- On the eigenvalues of trees
- Randić matrix and Randić energy
- Roots of cube polynomials of median graphs
- Upper bounds for Randić spread
Cited in
(13)- A relation on trees and the topological indices based on subgraph
- On the degeneracy of the Randić entropy and related graph measures
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Highly unique network descriptors based on the roots of the permanental polynomial
- Graph descriptors from B-matrix representation
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- Randić energy of specific graphs
- On efficient network similarity measures
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- Generalized permanental polynomials of graphs
- Szeged and Mostar root-indices of graphs
- Relations and bounds for the zeros of graph polynomials using vertex orbits
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)