Graphs which their certain polynomials have few distinct roots- a survey
Combinatorics
2011-12-06 v1
Abstract
Let G = (V;E) be a simple graph. We consider domination polynomial, matching polynomial and edge cover polynomial of G. Graphs which their polynomials have few roots can give sometimes a very surprising information about the structure of the graph. In this paper we study graphs which their domination polynomial, independence polynomial and edge cover polynomial have few roots.
Cite
@article{arxiv.1112.0838,
title = {Graphs which their certain polynomials have few distinct roots- a survey},
author = {Saeid Alikhani},
journal= {arXiv preprint arXiv:1112.0838},
year = {2011}
}
Comments
21 pages (with figures)