Abstract
We consider the problem on finding the edge weights that maximize the algebraic connectivity of a graph, subject to the condition that the total resistance remains constant. For the paths P3 y P4 the solution to the problem is given. It is conjectured that for general graphs the solution is given for weights distributions that are invariant under graph automorphisms.
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.
