Open AccessBook
The Embedding Problem For Switching Classes
A. Ehrenfeucht,Jurriaan Hage,Tero Harju,Grzegorz Rozenberg +3 more
- 01 Jan 2005
TL;DR: In this article, the authors consider the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labeled) graphs through local transformations of the vertices.
read more
Abstract: 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. In case vertices are given an identity, 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 sub- graph. However, when considering graphs up to isomorphism, we immediately run into the graph
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
A partial k -arboretum of graphs with bounded treewidth
TL;DR: This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class.
1.4K
A survey of two-graphs
J.J. Seidel
- 01 Jan 1976
TL;DR: In this article, a one-to-one correspondence between the two-graphs and the switching classes of graphs on the set of n elements is established, and the correspondence is shown to hold also for the binary maps with vanishing co-boundaries.
262
•Book
The theory of 2-structures
Andrzej Ehrenfeucht
- 01 Jan 1999
TL;DR: From the combination of knowledge and actions, someone can improve their skill and ability and this will lead them to live and work much better.
112
•Book
Geometry and Combinatorics: Selected Works of J.J. Seidel
J. J. Seidel,D. G. Corneil,R. A. Mathon +2 more
- 01 Jun 1991
TL;DR: Goethals line graphs, root systems, and elliptic geometry are surveyed by Cameron et al. as discussed by the authors, where they show that strongly regular graphs derived from combinatorial designs can be derived from the perfect ternary golay code.
52