Advertisement

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms

  • Jiří Fiala
  • Daniël Paulusma
  • Jan Arne Telle
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)

Abstract

Degree refinement matrices have tight connections to graph homomorphisms that locally, on the neighborhoods of a vertex and its image, are constrained to three types: bijective, injective or surjective. If graph G has a homomorphism of given type to graph H, then we say that the degree refinement matrix of G is smaller than that of H. This way we obtain three partial orders. We present algorithms that will determine whether two matrices are comparable in these orders. For the bijective constraint no two distinct matrices are comparable. For the injective constraint we give a PSPACE algorithm, which we also apply to disprove a conjecture on the equivalence between the matrix orders and universal cover inclusion. For the surjective constraint we obtain some partial complexity results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)zbMATHGoogle Scholar
  3. 3.
    Everett, M.G., Borgatti, S.: Role colouring a graph. Math. Soc. Sci. 21(2), 183–188 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Fiala, J., Kratochvíl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory 22, 89–99 (2002)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Fiala, J., Paulusma, D., Telle, J.A.: Matrix and graph orders derived from locally constrained graph homomorphisms. accepted for MFCS (2005)Google Scholar
  6. 6.
    Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)zbMATHCrossRefGoogle Scholar
  7. 7.
    Leighton, F.T.: Finite common coverings of graphs. Journal of Combinatorial Theory B 33, 231–238 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Roberts, F.S., Sheng, L.: How hard is it to determine if a graph has a 2-role assignment? Networks 37(2), 67–73 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jiří Fiala
    • 1
  • Daniël Paulusma
    • 2
  • Jan Arne Telle
    • 3
  1. 1.Faculty of Mathematics and Physics, DIMATIA and Institute for Theoretical Computer Science (ITI)Charles UniversityPragueCzech Republic
  2. 2.Department of Computer ScienceUniversity of Durham, Science LaboratoriesDurhamEngland
  3. 3.Department of InformaticsUniversity of BergenBergenNorway

Personalised recommendations