Pages that link to "Item:Q668097"
From MaRDI portal
The following pages link to Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix (Q668097):
Displayed 11 items.
- Randić energy of specific graphs (Q668724) (← links)
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration (Q1733738) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- Szeged and Mostar root-indices of graphs (Q2700357) (← links)
- A Relation on Trees and the Topological Indices Based on Subgraph (Q5050771) (← links)