|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2014, Volume 11, Pages 988–998
(Mi semr544)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
On switching nonseparable graphs with switching separable subgraphs
E. A. Bespalovab a Novosibirsk State University, Pirogova 2, 630090, Novosibirsk, Russia
b Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
Abstract:
A graph of order $n \ge 4$ is called switching separable if its modulo-$2$ sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We describe all switching nonseparable graphs of order $n$ whose induced subgraphs of order $(n-1)$ are all switching separable. In particular, such graphs exist only if $n$ is odd. This leads to the following essential refinement of the known test on switching separability, in terms of subgraphs: if all order-$(n-1)$ subgraphs of a graph of order $n$ are separable, then either the graph itself is separable, or $n$ is odd and the graph belongs to the two described switching classes.
Keywords:
Two-graph, switching of graph, switching separability, Seidel switching, $n$-ary quasigroup.
Received October 31, 2014, published December 25, 2014
Citation:
E. A. Bespalov, “On switching nonseparable graphs with switching separable subgraphs”, Sib. Èlektron. Mat. Izv., 11 (2014), 988–998
Linking options:
https://www.mathnet.ru/eng/semr544 https://www.mathnet.ru/eng/semr/v11/p988
|
Statistics & downloads: |
Abstract page: | 181 | Full-text PDF : | 41 | References: | 34 |
|