Abstract
We compute the absorbing number of the edge ideals of special graphs such as complete graphs, path graphs, and cycle graphs. We also compute the absorbing number for other monomial ideals. In special cases, we show that the length of a prime filtration of a monomial ideal [Formula: see text] is an upper bound for its absorbing number.
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.
