Embedding in Switching Classes with Skew Gains

  • Andrzej Ehrenfeucht
  • Jurriaan Hage
  • Tero Harju
  • Grzegorz Rozenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3256)


In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labelled) graphs through local transformations of the vertices.

Various relatively efficient algorithms exist for deciding whether a graph can be switched so that it contains some other graph, the query graph, as an induced subgraph in case vertices are given an identity. However, when considering graphs up to isomorphism, we immediately run into the graph isomorphism problem for which no efficient solution is known.

Surprisingly enough however, in some cases the decision process can be simplified by transforming the query graph into a “smaller” graph without changing the answer. The main lesson learned is that the size of the query graph is not the dominating factor, but its cycle rank.

Although a number of our results hold specifically for undirected, unlabelled graphs, we propose a more general framework and give some preliminary results for more general cases, where the graphs are labelled with elements of a group.


Abelian Group Output Action Graph Transformation Input Action Bridge Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 59–70. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures. World Scientific, Singapore (1999)zbMATHGoogle Scholar
  3. 3.
    Ehrenfeucht, A., Rozenberg, G.: Dynamic labeled 2-structures. Mathematical Structures in Computer Science 4, 433–455 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gross, J.L., Tucker, T.W.: Topological Graph Theory. Wiley, New York (1987)zbMATHGoogle Scholar
  5. 5.
    Hage, J.: The membership problem for switching classes with skew gains. Fundamenta Informaticae 39(4), 375–387 (1999)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Hage, J., Harju, T., Welzl, E.: Euler graphs, triangle-free graphs and bipartite graphs in swithing classes. Fundamenta Informaticae 58(1), 23–37 (2003)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Rotman, J.J.: The Theory of Groups, 2nd edn. Allyn and Bacon, Boston (1973)zbMATHGoogle Scholar
  8. 8.
    Zaslavsky, T.: Signed graphs. Discrete Applied Math. 4, 47–74 (1982); Erratum on p. 248 of volume 5.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Zaslavsky, T.: Biased graphs. I. Bias, balance, and gains. J. Combin. Theory, Ser. B 47, 32–52 (1989)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andrzej Ehrenfeucht
    • 2
  • Jurriaan Hage
    • 1
  • Tero Harju
    • 3
  • Grzegorz Rozenberg
    • 2
    • 4
  1. 1.Inst. of Information and Computing SciUniv. UtrechtUtrechtThe Netherlands
  2. 2.Dept. of Computer ScienceUniversity of Colorado at BoulderBoulderUSA
  3. 3.Dept. of MathematicsUniversity of TurkuTurkuFinland
  4. 4.Leiden Institute of Advanced Computer ScienceLeidenThe Netherlands

Personalised recommendations