Critical ideals of signed graphs with twin vertices
From MaRDI portal
Publication:515809
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}_{delta}(G)={G^{�f d}: {�f d}in mathbb{Z}^{|V|} ext{ such that } {�f d}_v=0 ext{ if and only if }delta_v=0 ext{ and } {�f d}_vdelta_v>0 ext{ 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 510847 (Why is no real title available?)
- A finite group attached to the laplacian of a graph
- Chip-firing and the critical group of a graph
- Eigenvalue location in cographs
- Graphs with two trivial critical ideals
- On the critical ideals of graphs
- On the sandpile group of dual graphs
- On the sandpile group of the cone of a graph
- Sandpile groups and spanning trees of directed line graphs
- Smith normal form and Laplacians
- The chip-firing game
- The critical group of a clique-inserted graph
- The critical group of a line graph
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Unimodular equivalence of graphs
Cited in
(11)- Distance ideals of graphs
- Small clique number graphs with three trivial critical ideals
- A note on the critical ideals of a cycle
- Replication in critical graphs and the persistence of monomial ideals
- The structure of sandpile groups of outerplanar graphs
- On graphs with 2 trivial distance ideals
- Graphs with few trivial critical ideals
- Critical ideals, minimum rank and zero forcing number
- Digraphs with at most one trivial critical ideal
- On the critical ideals of complete multipartite graphs
- Graphs with real algebraic co-rank at most two
This page was built for publication: Critical ideals of signed graphs with twin vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515809)