Relative complements and a `switch'-classification of simple graphs
From MaRDI portal
Abstract: In the paper we introduce and study a classification of finite (simple, undirected, loopless) graphs with respect to a switch-equivalence (`local-complement' equivalence of cite{pascvebl}, an analogue of the complement-equivalence of cite{conell}). In the paper we propose a simple inductive method to compute the number of switch-types of graphs on vertices and we show that there are exactly 16 such types of graphs on 6 vertices.
This page was built for publication: Relative complements and a `switch'-classification of simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264974)
