Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach

DOI10.1016/j.ins.2018.08.043zbMath1441.05194MaRDI QIDQ2200659

Frank Emmert-Streib, Abbe Mowshowitz, Shailesh Tripathi, Yongtang Shi, Yusen Zhang, Matthias Dehmer, Zeng-Qiang 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.08.043

zbMATH Keywords

networks; data science; quantitative graph theory; structural branching

Mathematics Subject Classification ID

05C31: Graph polynomials

05C75: Structural characterization of families of graphs

68T09: Computational aspects of data analysis and big data

Related Items

On the zeros of the partial Hosoya polynomial of graphs

Uses Software

• nauty
• R
• igraph
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Large-scale analysis of structural branching measures
• A history of graph entropy measures
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• A computational approach to construct a multivariate complete graph invariant
• On some counting polynomials in chemistry
• Zeros of chromatic and flow polynomials of graphs
• Highly unique network descriptors based on the roots of the permanental polynomial
• Practical graph isomorphism. II.
• On the eigenvalues of trees
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Cyclicity of graphs
• Roots of cube polynomials of median graphs
• A Generalization of a Theorem of Bôcher