Maximal Algebraic Connectivity for Paths with Fixed Effective Resistance
From MaRDI portal
Abstract: We consider the problem on finding the edge weights that maximize the algebraic connectivity of a graph (smallest positive eigenvalue of the Laplacian), subject to the condition that the total effective resistance is kept constant. We propose the conjecture that for every graph the maximum is attained for weights that are invariant under automorphisms. The solution to the problem is given explicitly for the paths y , where the conjecture holds.
This page was built for publication: Maximal Algebraic Connectivity for Paths with Fixed Effective Resistance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440233)