On the roots of independence polynomials of almost all very well-covered graphs.

Vadim E. Levit Eugen Mandrescu

Published in: Discret. Appl. Math. (2008)

Keyphrases

graph theoretic
graph matching
graph representation
database
series parallel
low order
graph theory
weighted graph
spanning tree
graph databases
data mining
graph structure
bipartite graph
graph partitioning
structured data
case study
knowledge base
subgraph isomorphism