相关论文: Circulant $S_2$ graphs

Let G be the circulant graph C_n(S) with S a subset of {1,2,...,\lfloor n/2 \rfloor}, and let I(G) denote its the edge ideal in the ring R = k[x_1,...,x_n]. We consider the problem of determining when G is Cohen-Macaulay, i.e, R/I(G) is a…

In this paper we show that if the Stanley-Reisner ring of the simplicial complex of independent sets of a bipartite graph $G$ satisfies Serre's condition $S_2$, then $G$ is Cohen-Macaulay. As a consequence, the characterization of…

We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milani\v{c}, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial…

We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite…

Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…

In this study, we obtain the following two families of circulant graphs each has Type-2 isomorphic circulant graphs w.r.t. $m$ such that $m$ has more than one value. (i) Family of circulant graphs $C_{432}(R)$, each has isomorphic circulant…

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…

We prove that wheels and block graphs have sequentially Cohen-Macaulay binomial edge ideals. Moreover, we provide a construction of new families of sequentially Cohen-Macaulay graphs by cones.

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…

A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and…

A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we will examine cactus graphs where all the blocks are $3$-cycles, i.e., triangular cactus graphs, of diameter $4$. Our main focus is to…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\Delta$ and…