Graphs determined by polynomial invariants

@article{citeulike:416937, abstract = {Many polynomials have been defined associated to graphs, like the characteristic, matchings, chromatic and Tutte polynomials. Besides their intrinsic interest, they encode useful combinatorial information about the given graph. It is natural then to ask to what extent any of these polynomials determines a graph and, in particular, whether one can find graphs that can be uniquely determined by a given polynomial. In this paper we survey known results in this area and, at the same time, we present some new results.}, author = {Noy, Marc }, citeulike-article-id = {416937}, comment = {* formula for coefficients of characteristic polynomial in terms of cycles}, doi = {http://dx.doi.org/10.1016/S0304-3975(03)00225-1}, journal = {Theoretical Computer Science}, keywords = {graph-theory, spectral}, month = {October}, number = {2}, pages = {365--384}, posted-at = {2008-02-16 23:18:59}, priority = {2}, title = {Graphs determined by polynomial invariants}, url = {http://dx.doi.org/10.1016/S0304-3975(03)00225-1}, volume = {307}, year = {2003} }

TY - JOUR ID - citeulike:416937 L3 - citeulike-article-id:416937 TI - Graphs determined by polynomial invariants JF - Theoretical Computer Science VL - 307 IS - 2 SP - 365 EP - 384 N2 - Many polynomials have been defined associated to graphs, like the characteristic, matchings, chromatic and Tutte polynomials. Besides their intrinsic interest, they encode useful combinatorial information about the given graph. It is natural then to ask to what extent any of these polynomials determines a graph and, in particular, whether one can find graphs that can be uniquely determined by a given polynomial. In this paper we survey known results in this area and, at the same time, we present some new results. KW - graph-theory KW - spectral N1 - * formula for coefficients of characteristic polynomial in terms of cycles AU - Noy, Marc PY - 2003/10/07/ UR - http://dx.doi.org/10.1016/S0304-3975(03)00225-1 ER -