Work

A Note on Matchings and Regularity of Graphs

Year: 2025

Type: article

Abstract: Let 𝐺 be a simple graph. We introduce the notion of comb- match(𝐺), and prove that reg(𝐼(𝐺)) ≤ comb-match(𝐺)+1. This improves some known bounds. Keywords: Regularity; edge ideal; matching; Cameron- Walker graph

Source: Vinh University Journal of Science

DOI: 10.56824/vujs.2024a153a

Author: DAO Thi Thanh Ha

Language: English

Topic: Commutative Algebra and Its Applications

Subfield: Algebra and Number Theory

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4408769070

FWCI:

Cites: 12

Cited by:

Related to: 10