arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.06257math.COmath.AC
收藏

双顶点符号图的临界理想

Critical ideals of signed graphs with twin vertices

Carlos A. Alfaro, Hugo Corrales, Carlos E. Valencia

摘要:

本文研究了具有相同邻点的双顶点图的临界理想。如果一对这样的顶点相邻,则称为复制的,否则称为重复的。具有双顶点的图的临界理想具有很好的性质,并显示出规则的模式。给定一个图$G=(V,E)$和${\bf d}\in \mathbb{Z}^{|V|}$,设$G^{\bf d}$是从$G$获得的图,当分别为${\bf d}_v>0$或${\bf d}_v<0$时,通过复制${\bf d}_v$倍或复制$-{\bf d}_v$倍顶点$v$。此外,给定$δ\in \{0,1,-1\}^{|V|}$,令\[ \mathcal{T}_δ(G)=\{G^{\bf d}: {\bf d}\in \mathbb{Z}^{|V|} \text{ such that } {\bf d}_v=0 \text{ if and only if }δ_v=0 \text{ and } {\bf d}_vδ_v>0 \text{ otherwise}\} \]是共享相同的顶点重复或复制模式的图的集合。$\mathcal{T}_δ(G)$中图的一半以上的临界理想可以由$G$的临界理想决定。图$G$的代数余秩是使$G$的$i$ -{ \it th}临界理想平凡的最大整数$i$。证明了$\mathcal{T}_δ(G)$中任意图的代数余秩都等于$G^δ$的代数余秩.对于一个足够大的${\bf d}\in \mathbb{Z}^{V(G)}$,我们证明了$G^{\bf d}$的临界理想与$G$与完全图的某些集合$\{K_{n_v}\}_{\{v\in V(G)| d_v<0\}}$和平凡图的某些集合$\{T_{n_v}\}_{\{v\in V(G) \, |\, {\bf d}_v>0\}}$的不交并的临界理想具有相似的行为.此外,我们还对双顶点图的代数余秩的分布作了重要的讨论。这些图意味着无孪生图具有大的代数余秩,而具有小代数余秩的图至少有一对孪生顶点。

英文摘要:

This paper studies critical ideals of graphs with twin vertices, which are vertices with the same neighbors. A pair of such vertices are called replicated if they are adjacent, and duplicated, otherwise. Critical ideals of graphs having twin vertices have good properties and show regular patterns. Given a graph $G=(V,E)$ and ${\bf d}\in \mathbb{Z}^{|V|}$, let $G^{\bf d}$ be the graph obtained from $G$ by duplicating ${\bf d}_v$ times or replicating $-{\bf d}_v$ times the vertex $v$ when ${\bf d}_v>0$ or ${\bf d}_v<0$, respectively. Moreover, given $δ\in \{0,1,-1\}^{|V|}$, let \[ \mathcal{T}_δ(G)=\{G^{\bf d}: {\bf d}\in \mathbb{Z}^{|V|} \text{ such that } {\bf d}_v=0 \text{ if and only if }δ_v=0 \text{ and } {\bf d}_vδ_v>0 \text{ otherwise}\} \] be the set of graphs sharing the same pattern of duplication or replication of vertices. More than one half of the critical ideals of a graph in $\mathcal{T}_δ(G)$ can be determined by the critical ideals of $G$. The algebraic co-rank of a graph $G$ is the maximum integer $i$ such that the $i$-{\it th} critical ideal of $G$ is trivial. We show that the algebraic co-rank of any graph in $\mathcal{T}_δ(G)$ is equal to the algebraic co-rank of $G^δ$. For a large enough ${\bf d}\in \mathbb{Z}^{V(G)}$, we show that the critical ideals of $G^{\bf d}$ have similar behavior to the critical ideals of the disjoint union of $G$ and some set $\{K_{n_v}\}_{\{v\in V(G)| d_v<0\}}$ of complete graphs and some set $\{T_{n_v}\}_{\{v\in V(G) \, |\, {\bf d}_v>0\}}$ of trivial graphs. Additionally, we pose important conjectures on the distribution of the algebraic co-rank of the graphs with twins vertices. These conjectures imply that twin-free graphs have a large algebraic co-rank, meanwhile a graph having small algebraic co-rank has at least one pair of twin vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑