Contractors and connectors of graph algebras
Open Access
- 6 October 2008
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 60 (1) , 11-30
Abstract
We study generalizations of the “contraction‐deletion” relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and homomorphisms of graphs, J. Amer. Math. Soc. 20 (2007), 37–51.] Graph algebras are defined by a graph parameter, and they were introduced in order to study and characterize homomorphism functions. We prove that for homomorphism functions, these graph algebras have special elements called “contractors” and “connectors”. This gives a new characterization of homomorphism functions. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 11–30, 2009Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Generalized quasirandom graphsJournal of Combinatorial Theory, Series B, 2008
- CONNECTION MATRICES2007
- Limits of dense graph sequencesJournal of Combinatorial Theory, Series B, 2006
- The rank of connection matrices and the dimension of graph algebrasEuropean Journal of Combinatorics, 2006
- Reflection positivity, rank connectivity, and homomorphism of graphsJournal of the American Mathematical Society, 2006