Abstract
An n-crown on 2n vertices is a graph obtained from complete bipartite graph by removing edges of a perfect matching. Given a finite simple graph G, one can associate a simplicial complex . In this article, we use combinatorial data from the associated simplicial complex of the crown graph and give formulas to find all Betti numbers of edge ideals of .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
