The size of switching classes with skew gains
type: Item
instance of: scholarly article
title: The size of switching classes with skew gains
zbMATH Open document ID: 0949.05039
DOI: 10.1016/S0012-365X(99)00243-5
author: Jurriaan Hage
author: Tero Harju
published in: Discrete Mathematics
publication date: 2000-05-07T00:00:00Z
review text: Graphs in which each edge has a gain (a label from a group so that reversing the direction inverts the gain) are said to be gain graphs. The gain graphs considered in this paper have the property that the gain of an edge is related to the gain of the reverse edge by an anti-involution. Such graphs are said to be skew gain graphs. The authors consider the problem of computing the size of equivalence classes related to a generalization of Seidel switching of an undirected graph. At first the problem is solved for complete graphs. Then the general problem is solved by reduction to the class of complete graphs and bipartite graphs, respectively.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1439825
zbMATH Keywords: gain graphs
zbMATH Keywords: Seidel switching
reviewed by: Ulrike Baumann
MaRDI profile type: Publication
full work available at URL: s0012-365x(99)00243-5
OpenAlex ID: W2058926226
description: scientific article; zbMATH DE number 1439825