Abstract
AbstractFor a simple bipartite graph G, we give an upper bound for the regularity of powers of the edge ideal $I(G)$ in terms of its vertex domination number. Consequently, we explicitly compute the regularity of powers of the edge ideal of a bipartite Kneser graph. Further, we compute the induced matching number of a bipartite Kneser graph.
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.
