Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms
We consider three types of locally constrained graph homomorphisms: bijective, injective and surjective. We show that the three orders imposed on graphs by existence of these three types of homomorphisms are partial orders. We extend the well-known connection between degree refinement matrices of graphs and locally bijective graph homomorphisms to locally injective and locally surjective homomorphisms by showing that the orders imposed on degree refinement matrices by our locally constrained graph homomorphisms are also partial orders. We provide several equivalent characterizations of degree (refinement) matrices, e.g. in terms of the dimension of the cycle space of a graph related to the matrix. As a consequence we can efficiently check whether a given matrix M is a degree matrix of some graph and also compute the size of a smallest graph for which it is a degree matrix in polynomial time.
KeywordsPartial Order Universal Cover Regular Graph Local Constraint Surjective Homomorphism
Unable to display preview. Download preview PDF.
- 1.Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82–93 (1980)Google Scholar
- 3.Bastert, O.: Computing equitable partitions of graphs. Communications in Mathematical and in Computer Chemistry (40), 265–272 (1999)Google Scholar
- 6.Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London, Elsevier, New York (1976)Google Scholar
- 11.Fiala, J., Maxová, J.: Cantor-Bernstein type theorem for locally constrained graph homomorphisms. preprint (2003), http://kam.mff.cuni.cz/fiala/papers/cantor.ps
- 12.Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. In: Theoretical Computer Science (to appear )Google Scholar