相关论文: On the critical group of the k-partite graph

Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…

In this paper we compute the critical group of the Kneser graph $KG(n,2)$. This is equivalent to computing the Smith normal form of a Laplacian matrix of this graph.

The critical group of a finite graph is an abelian group defined by the Smith normal form of the Laplacian. We determine the the critical groups of the Peisert graphs, a certain family of strongly regular graphs similar to, but different…

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…

We consider the critical group of a hypothetical Moore graph of diameter $2$ and valency $57$. Determining this group is equivalent to finding the Smith normal form of the Laplacian matrix of such a graph. We show that all of the Sylow…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

Critical ideals generalize the critical group, Smith group and the characteristic polynomials of the adjacency and Laplacian matrices of a graph. We give a complete characterization of the digraphs with at most one trivial critical ideal.…

There is a Paley graph for each prime power $q$ such that $q\equiv 1\pmod 4$. The vertex set is the field $\mathbb Fq$ and two vertices $x$ and $y$ are joined by an edge if and only if $x-y$ is a nonzero square of $\mathbb Fq$. We compute…

We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of…

Let $G$ be a finite, connected, simple graph. The critical group $K(G)$, also known as the sandpile group, is the torsion subgroup of the cokernel of the graph Laplacian $\operatorname{cok}(L)$. We investigate a family of graphs with…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

We compute the elementary divisors of the adjacency and Laplacian matrices of the Grassmann graph on $2$-dimensional subspaces in a finite vector space. We also compute the corresponding invariants of the complementary graphs.

For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$.…

The \emph{critical} group of a finite connected graph is an abelian group defined by the Smith normal form of its Laplacian. Let $q$ be a power of a prime and $H$ be a multiplicative subgroup of $K=\mathbb{F}_{q}$. By $\mathrm{Cay}(K,H)$ we…

Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…

These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…

In this paper, the structure of the critical group of the graph $K_m\times C_n$ is determined, where $m, n\ge 3$.

This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…

The class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique- and rank-width of graphs, because it is one of the minimal hereditary classes of…