Algebraic invariants of weighted oriented graphs

نویسندگان

چکیده

Let $$\mathcal {D}$$ be a weighted oriented graph and let $$I(\mathcal {D})$$ its edge ideal in polynomial ring R. We give the formula of Castelnuovo–Mumford regularity $$R/I(\mathcal when is path or cycle such that edges are one direction. Additionally, we compute projective dimension for this class graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algebraic Framework of Weighted Directed Graphs

We show that an algebraic formulation of weighted directed graphs leads to introducing a k-vector space equipped with two coproducts ∆ and˜∆ verifying the so-called coassociativity breaking equation (˜ ∆ ⊗ id)∆ = (id ⊗∆) ˜ ∆. Such a space is called an L-coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are given. 1. Introduct...

متن کامل

Antimagic Labelings of Weighted and Oriented Graphs∗

A graph G is k–weighted–list–antimagic if for any vertex weighting ω : V (G) → R and any list assignment L : E(G)→ 2R with |L(e)| ≥ |E(G)|+k there exists an edge labeling f such that f(e) ∈ L(e) for all e ∈ E(G), labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this pa...

متن کامل

Algebraic invariants arising from the chromatic polynomials of theta graphs

This paper investigates some algebraic properties of the chromatic polynomials of theta graphs, i.e. graphs which have three internally disjoint paths sharing the same two distinct end vertices. We give a complete description of the Galois group, discriminant and ramification indices for the chromatic polynomials of theta graphs with three consecutive path lengths. We then do the same for theta...

متن کامل

Algebraic Invariants of Knots

In the first half, we’ll construct algebraic invariants and go over the classification of high dimensional simple knots. For reference, see Farber, Classification of simple knots. In the second half, we’ll compute invariants and discuss connections to number theory. Time permitting, we’ll go over applications of these invariants. In its most generality, knot theory studies the embeddings of man...

متن کامل

New skew equienergetic oriented graphs

Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2021

ISSN: ['0925-9899', '1572-9192']

DOI: https://doi.org/10.1007/s10801-021-01058-2