Relations and bounds for the zeros of graph polynomials using vertex orbits.
Matthias DehmerFrank Emmert-StreibAbbe MowshowitzAleksandar IlicZengqiang ChenGuihai YuLihua FengModjtaba GhorbaniKurt VarmuzaJin TaoPublished in: Appl. Math. Comput. (2020)
Keyphrases
- directed graph
- undirected graph
- dependency graph
- labeled graphs
- hamiltonian cycle
- random walk
- minimum weight
- lower bound
- upper bound
- edge weights
- graph representation
- dynamical systems
- graph theory
- graph structures
- structured data
- graph structure
- weighted graph
- directed acyclic graph
- attributed graphs
- social graphs
- strongly connected
- graph mining
- graph model
- vertex set
- upper and lower bounds
- maximum cardinality
- graph databases
- relational structures
- social networks
- spatial relations
- graph matching
- semantic relations
- worst case
- temporal relations
- graph theoretic
- topological information
- bipartite graph
- connected components
- shortest path
- average degree
- higher order relations