Abstract
In 2019, Ye and Yan computed the effective resistances in the nearly balanced complete bipartite graph Kn,n−pK2(p≤n). Then the result was extended to Km,n−pK2(p≤min{m,n}) very recently. In this paper, we obtain the effective resistances and the number of spanning trees in any complete bipartite graph plus a matching.
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.
