DSpace Repository

The v-number and Castelnuovo-Mumford regularity of graphs

Show simple item record

dc.creator CİVAN, Yusuf
dc.date 2023-02-01T00:00:00Z
dc.identifier 9f4d2fca-5d5f-4bfc-afb3-b6577abeb53a
dc.identifier 10.1007/s10801-022-01164-9
dc.identifier https://avesis.sdu.edu.tr/publication/details/9f4d2fca-5d5f-4bfc-afb3-b6577abeb53a/oai
dc.description We prove that for every integer k >= 1, there exists a connected graph H-k such that v(H-k) = reg(H-k) + k, where v(G) and reg(G) denote the v-number and the (Castelnuovo-Mumford) regularity of a graph G respectively.
dc.language eng
dc.rights info:eu-repo/semantics/openAccess
dc.title The v-number and Castelnuovo-Mumford regularity of graphs
dc.type info:eu-repo/semantics/article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account