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.
Full Text
Accepted Version (
Free)
Published Version
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 call