Abstract
M. Fiedler recently introduced the following question. What is the optimal distribution of nonnegative weights (with total sum one) among the edges of a given graph, so that the spectral radius of the resulting adjacency matrix is minimum? He himself has shown that the optimum solution is achieved by some decomposition of the given graph G into a collection of mutually vetex disjoint odd cycles and balanced bipartite subgraphs which maximizes a certain objective function. We present a polynomial time algorithm which finds this decomposition. Our approach is related to matching theory.
Sign-in/Register to access full text options 
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.
