Graph measures with high discrimination power revisited: a random polynomial approach

DOI10.1016/J.INS.2018.07.072MaRDI QIDQ2200600zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi, Zengqiang Chen

Publication date 22 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.07.072

zbMATH Keywords

data sciencegraphsnetworksquantitative graph theorystatistics

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Probabilistic graphical models (62H22) Statistical aspects of big data and data science (62R07) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
• Highly unique network descriptors based on the roots of the permanental polynomial
• Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
• scientific article; zbMATH DE number 6271723
• A computational approach to construct a multivariate complete graph invariant

Cites work

• A computational approach to construct a multivariate complete graph invariant
• A history of graph entropy measures
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• Graph energy
• Graph polynomials
• Graph polynomials and their applications. I: The Tutte polynomial
• Graph-theoretical matrices in chemistry
• Highly unique network descriptors based on the roots of the permanental polynomial
• scientific article; zbMATH DE number 5981039 (Why is no real title available?)
• scientific article; zbMATH DE number 3839994 (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 50596 (Why is no real title available?)
• scientific article; zbMATH DE number 165465 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• Information processing in complex networks: Graph entropy and information functionals
• On Some Applications of Information Indices in Chemical Graph Theory
• On some counting polynomials in chemistry
• On the distribution of roots of polynomials
• On the Number of Real Roots of a Random Algebraic Equation
• Roots of cube polynomials of median graphs
• Zeros of chromatic and flow polynomials of graphs
• Zeros of polynomials with random coefficients

Cited in

(5)

• Highly unique network descriptors based on the roots of the permanental polynomial
• Generalized permanental polynomials of graphs
• On the zeros of the partial Hosoya polynomial of graphs
• A finite-dimensional linear framework for vertex-degree-based topological indices
• Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial

Describes a project that uses

Uses Software

• Mathematica
• R
• CPOLY
• QuACN

This page was built for publication: Graph measures with high discrimination power revisited: a random polynomial approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200600)