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

DOI10.1016/J.AMC.2020.125239MaRDI QIDQ2180690zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib, Abbe Mowshowitz, Aleksandar Ilić, Guihai Yu, Kurt Varmuza, Jin Tao, Zengqiang Chen, Lihua Feng, Modjtaba Ghorbani

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

data sciencegraph measuresgraphsnetworksquantitative graph theorysymmetry

Mathematics Subject Classification ID

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

Recommendations

• Orbit polynomial graphs of prime order
• Zeros of graph-counting polynomials
• Orbital Chromatic and Flow Roots
• Chromatic bounds on orbital chromatic roots
• On the zeros of the partial Hosoya polynomial of graphs

Cites work

• A Generalization of a Theorem of Bôcher
• Complexity in chemistry, biology and ecology.
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• 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
• Graph polynomials
• Graph polynomials and their applications. I: The Tutte polynomial
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3839994 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• On some counting polynomials in chemistry
• Zeros of chromatic and flow polynomials of graphs

Cited in

(6)

• From a zoo to a zoology: Towards a general theory of graph polynomials
• Szeged and Mostar root-indices of graphs
• A survey on orbit polynomials
• On automorphisms and fixing number of co-normal product of graphs
• Correlating side effects and properties of analgesics with distance- and degree-based topological indices
• On the Wiener-like root-indices of graphs

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

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