相对补与单图的“开关”分类
Relative complements and a `switch'-classification of simple graphs
摘要:
在本文中,我们介绍和研究有限(简单,无向,无环)图的分类开关等价(“本地补充”等价的\cite{pascvebl},一个模拟的补充等价的\cite{conell})。本文提出了一个简单的归纳方法来计算$n$顶点图的开关类型的个数,并证明了6个顶点图的开关类型正好有16个。
英文摘要:
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 $n$ vertices and we show that there are exactly 16 such types of graphs on 6 vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。