Pseudo-Gorenstein$^{*}$ Graphs
Takayuki Hibi, Selvi Kara, Dalena Vien
TL;DR
This paper introduces pseudo-Gorenstein$^{*}$ graphs, a new class inspired by algebraic properties, and classifies them within various graph families using independence polynomials.
Contribution
It defines pseudo-Gorenstein$^{*}$ graphs and provides a classification within natural graph families based on independence polynomials.
Findings
Classification of pseudo-Gorenstein$^{*}$ graphs in several families
Use of independence polynomials for characterization
Connection to algebraic properties in graph theory
Abstract
Motivated by pseudo-Gorenstein rings in commutative algebra, introduced by Herzog et al., we define pseudo-Gorenstein graphs and classify them in several natural graph families using independence polynomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic structures and combinatorial models · Advanced Combinatorial Mathematics