Let be a finite and simple graph without isolated vertices. We investigate the projective dimension of the closed neighborhood hypergraph and its relationship with the Castelnuovo-Mumford regularity of the extended bipartite double cover of . We establish the general upper bound for all graphs. Furthermore, we prove that the exact equalities hold when belongs to several prominent graph classes, including König-Egerváry (contains all bipartite graphs), cographs, co-chordal, chordal and comparability graphs, where denotes the independence number. Our method of proofs relies on connecting algebraic invariants to the underlying combinatorial structure of graphs through covering, domination and matching parameters, together with the use of homology tools.

生成讲解博客的中文版本

生成AI智能校验的中文版本