A NOTE ON MATCHINGS AND REGULARITY OF GRAPHS

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

Authors

Publication Details

Journal
Vinh University Journal of Science
Published
2025-03-20
DOI
https://doi.org/10.56824/vujs.2024a153a
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A NOTE ON MATCHINGS AND REGULARITY OF GRAPHS

DAO Thi Thanh Ha
Vinh University Journal of Science
Advanced Graph Theory Research
article

A NOTE ON MATCHINGS AND REGULARITY OF GRAPHS

DAO Thi Thanh Ha
article en

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

Vinh University Journal of ScienceVol. 54(1A)
Openalex Percentile: Top 93%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A NOTE ON MATCHINGS AND REGULARITY OF GRAPHS โ€” DAO Thi Thanh Ha ยท Vinh University Journal of Science (2025) | TGRS Research Map | TGRS