| dc.creator |
Biyikoglu, Turker |
|
| dc.creator |
CİVAN, Yusuf |
|
| dc.date |
2019-02-28T21:00:00Z |
|
| dc.date.accessioned |
2020-10-06T10:14:10Z |
|
| dc.date.available |
2020-10-06T10:14:10Z |
|
| dc.identifier |
547d1223-99cf-4927-af12-de250e86f890 |
|
| dc.identifier |
10.1216/jca-2019-11-1-1 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/547d1223-99cf-4927-af12-de250e86f890/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/60343 |
|
| dc.description |
We demonstrate the effectiveness of prime graphs for the calculation of the (Castelnuovo-Mumford) regularity of graphs. Such a notion allows us to reformulate the regularity as a generalized induced matching problem and perform regularity calculations in specific graph classes, including (C-3; P-5)-free graphs, P-6-free bipartite graphs and all Cohen-Macaulay graphs of girth at least five. In particular, we verify that the five cycle graph C-5 is the unique connected graph satisfying the inequality im(G) < reg(G) = m(G). In addition, we prove that, for each integer n >= 1, there exists a vertex decomposable perfect prime graph G(n) with reg(G(n)) = n. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
PRIME GRAPHS, MATCHINGS AND THE CASTELNUOVO-MUMFORD REGULARITY |
|
| dc.type |
info:eu-repo/semantics/article |
|