关于嵌套图和2-嵌套图:阈值图和分裂图之间的两个图子类
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
摘要:
一个$(0,1)$ -矩阵具有连续1属性(C1 P)的行,如果有一个置换的列,使每一行中的1出现连续。我们说一个$(0, 1)$ -矩阵是嵌套的,如果它的行具有连续1的性质(C1 P),并且每两行是不相交的或嵌套的。我们说一个$(0, 1)$ -矩阵是2-嵌套的,如果它有C1 P,并且允许将它的行分成两个集合,使得由每个集合导出的子矩阵是嵌套的。我们说一个分裂图$G$与分裂分区$(K, S)$是嵌套的(分别为\ 2-嵌套),如果指示$S$和$K$中的顶点之间的邻接的矩阵$A(S, K)$是嵌套的(分别2-嵌套)。本文利用最小禁止子矩阵刻画了嵌套矩阵和2-嵌套矩阵。这一特征导致这些类的图,这是一个超类的阈值图和一个子类的分裂和循环图的最小禁止诱导子图的特征。
英文摘要:
A $(0,1)$-matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)$-matrix is nested if it has the consecutive ones property for the rows (C1P) and every two rows are either disjoint or nested. We say a $(0, 1)$-matrix is 2-nested if it has the C1P and admits a partition of its rows into two sets such that the submatrix induced by each of these sets is nested. We say a split graph $G$ with split partition $(K, S)$ is nested (resp.\ 2-nested) if the matrix $A(S, K)$ which indicates the adjacency between vertices in $S$ and $K$ is nested (resp.\ 2-nested). In this work, we characterize nested and 2-nested matrices by minimal forbidden submatrices. This characterization leads to a minimal forbidden induced subgraph characterization for these classes of graphs, which are a superclass of threshold graphs and a subclass of split and circle graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。