关于秩的极大图
Maximal graphs with respect to rank
摘要:
图的秩定义为它的邻接矩阵的秩。如果一个图没有孤立的顶点,也没有两个顶点具有相同的邻居集,则该图被称为约简图。一个约简图$G$称为极大图,如果任何包含$G$作为真诱导子图的约简图都有较高的秩.本文的主要目的是给出极大图的一些结果。首先,我们介绍了最大树的一个特征(一个约简树是一个最大树,如果它不是一个约简树的具有相同秩的真子树)。其次,我们给出了极大广义友谊图的一个近似完全刻画。最后,我们给出了所有秩为$8$和$9$的极大图的一个计数。直到$7$的排名已经由Lepović(1990)、Ellingham(1993)和Lazić(2010)完成。
英文摘要:
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced graph containing $G$ as a proper induced subgraph has a higher rank. The main intent of this paper is to present some results on maximal graphs. First, we introduce a characterization of maximal trees (a reduced tree is a maximal tree if it is not a proper subtree of a reduced tree with the same rank). Next, we give a near-complete characterization of maximal `generalized friendship graphs.' Finally, we present an enumeration of all maximal graphs with ranks $8$ and $9$. The ranks up to $7$ were already done by Lepović (1990), Ellingham (1993), and Lazić (2010).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。