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
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Trường Đại học Vinh
2025-03-01
|
| Series: | Tạp chí Khoa học |
| Subjects: | |
| Online Access: | https://vujs.vn//api/view.aspx?cid=001bc3a1-684a-47e0-bc82-6ec0805c0177 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|