paper

Critical ideals of signed graphs with twin vertices

arXiv:1504.06257

Abstract

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 and , let be the graph obtained from by duplicating times or replicating times the vertex when or , respectively. Moreover, given , 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 can be determined by the critical ideals of . The algebraic co-rank of a graph is the maximum integer such that the -{\it th} critical ideal of is trivial. We show that the algebraic co-rank of any graph in is equal to the algebraic co-rank of . For a large enough , we show that the critical ideals of have similar behavior to the critical ideals of the disjoint union of and some set of complete graphs and some set 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.

26 pages, 9 figures. Major changes from the previous version. Accepted in Advanced in Applied Mathematics