Related papers: Adjacency-Like Conditions and Induced Ideal Graphs
Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…
This paper investigates the relationship between multiplicities and the degree sequence of ideals in graded algebras, gives multiplicity equations of graded rings via the degree sequence of ideals, and characterizes mixed multiplicities and…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.
Generally speaking, `almost distance-regular' graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity,…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
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…
In this paper we focus on the structure of the variety of Lie algebras with a finite number of ideals and their graph representations using Hasse diagrams. The large number of necessary conditions on the algebraic structure of this type of…
We compute the depth and regularity of ideals associated with arbitrary fillings of positive integers to a Young diagram, called the tableau ideals.
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
The regularity of the Rees ring of the edge ideal of a finite simple graph is studied. We show that the matching number is a lower and matching number~$+1$ is an upper bound of the regularity, if the Rees algebra is normal. In general the…
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,…
In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
We give a formula for the v-number of a graded ideal that can be used to compute this number. Then we show that for the edge ideal $I(G)$ of a graph $G$ the induced matching number of $G$ is an upper bound for the v-number of $I(G)$ when…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
Conditional independence models in the Gaussian case are algebraic varieties in the cone of positive definite covariance matrices. We study these varieties in the case of Bayesian networks, with a view towards generalizing the recursive…