Relations and bounds for the zeros of graph polynomials using vertex orbits

DOI10.1016/j.amc.2020.125239zbMath1461.62082OpenAlexW3019646692MaRDI QIDQ2180690

Guihai Yu, Frank Emmert-Streib, Kurt Varmuza, Aleksandar Ilić, Jin Tao, Abbe Mowshowitz, Matthias Dehmer, Modjtaba Ghorbani, Li-Hua Feng, Zeng-Qiang Chen

Publication date: 14 May 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125239

zbMATH Keywords

symmetrynetworksgraphsdata sciencegraph measuresquantitative graph theory

Mathematics Subject Classification ID

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

Related Items (1)

Szeged and Mostar root-indices of graphs

Cites Work

• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• On some counting polynomials in chemistry
• Zeros of chromatic and flow polynomials of graphs
• Graph Polynomials
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• A Generalization of a Theorem of Bôcher
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relations and bounds for the zeros of graph polynomials using vertex orbits