Topological graph theory
Biased graphs. I. Bias, balance, and gains
Journal of Combinatorial Theory Series B - Series B
Acyclicity of switching classes
European Journal of Combinatorics
Discrete Applied Mathematics
The size of switching classes with skew gains
Discrete Mathematics
Pancyclicity in switching classes
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity Issues in Switching of Graphs
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
SIAM Journal on Discrete Mathematics
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
The Membership Problem for Switching Classes with Skew Gains
Fundamenta Informaticae
Hi-index | 0.00 |
Gain graphs are graphs in which each edge has a gain (a label from a group so that reversing the direction of an edge inverts the gain). In this paper we take a generalized view of gain graphs in which the gain of an edge is related to the gain of the reverse edge by an anti-involution, i.e., an anti-automorphism of order at most two. We call these skew gain graphs. Switching is an operation that transforms one skew gain graph into another, driven by a selector that selects an element of some group Γ in each of its vertices. In this paper, we investigate a generalization of this model, in which we insist that in each vertex v the selected elements are taken from a subgroup Γv of Γ. We call this operation subgroup switching. Our main interest in this paper is in establishing which properties of the theory of switching classes of the skew gain graphs carry over to subgroup switching classes, and which do not.