Abstract
A graph polynomial \(p(G, \bar{X})\) can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points \(\bar{X}= \bar{x}_0\). In this paper we study the question how to prove that a given graph parameter, say ω(G), the size of the maximal clique of G, cannot be a fixed coefficient or the evaluation at any point of the Tutte polynomial, the interlace polynomial, or any graph polynomial of some infinite family of graph polynomials.
Our result is very general. We give a sufficient condition in terms of the connection matrix of graph parameter f(G) which implies that it cannot be the evaluation of any graph polynomial which is invariantly definable in CMSOL, the Monadic Second Order Logic augmented with modular counting quantifiers. This criterion covers most of the graph polynomials known from the literature.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B 92, 199–233 (2004)
Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)
Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)
Courcelle, B., Olariu, S.: Upper bounds to the clique–width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
Courcelle, B.: A multivariate interlace polynomial and its computation for graphs of bouded clique-width. Electronic Journal of Combinatorics 15(1), R69 (2008)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1996)
Edwards, K., McDiarmid, C.: The complexity of harmonious colouring for trees. Discrete Appl. Math. 57(2-3), 133–144 (1995)
Freedman, M., Lovász, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphisms of graphs. Journal of AMS 20, 37–51 (2007)
Goodall, A.J.: Some new evaluations of the Tutte polynomial. Journal of Combinatorial Theory, Series B 96, 207–224 (2006)
Goodall, A.J.: Parity, eulerian subgraphs and the Tutte polynomial. Journal of Combinatorial Theory, Series B 98(3), 599–628 (2008)
Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)
Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126(1–3), 159–213 (2004)
Makowsky, J.A.: Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Disc. Appl. Math. 145(2), 276–290 (2005)
Makowsky, J.A.: From a zoo to a zoology: Towards a general theory of graph polynomials. Theory of Computing Systems (July 2007), http://dx.doi.org/10.1017/s00224-007-9022-9
Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint No. 21 (2006), http://www.logique.jussieu.fr/modnet/Publications/Preprint%20server
Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol. 186. Cambridge University Press, Cambridge (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godlin, B., Kotek, T., Makowsky, J.A. (2008). Evaluations of Graph Polynomials. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-92248-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92247-6
Online ISBN: 978-3-540-92248-3
eBook Packages: Computer ScienceComputer Science (R0)