Graphs for the design of networks or electronic circuits are usually weighted and the spectrum of weighted graphs are often analyzed to solve problems. This paper discusses the spectrum and the spectral radii of tree...Graphs for the design of networks or electronic circuits are usually weighted and the spectrum of weighted graphs are often analyzed to solve problems. This paper discusses the spectrum and the spectral radii of trees with edge weights. We derive expressions for the spectrum and the spectral radius of a weighted star, together with the boundary limits of the spectral radii for weighted paths and weighted trees. The analysis uses the theory of nonnegative matrices and applies the 'moving edge' technique. Some simple examples of weighted paths and trees are presented to explain the results. Then, we propose some open problems in this area.展开更多
基金Supported by the National Basic Research PrioritiesProgram(No.G19990 32 90 3
文摘Graphs for the design of networks or electronic circuits are usually weighted and the spectrum of weighted graphs are often analyzed to solve problems. This paper discusses the spectrum and the spectral radii of trees with edge weights. We derive expressions for the spectrum and the spectral radius of a weighted star, together with the boundary limits of the spectral radii for weighted paths and weighted trees. The analysis uses the theory of nonnegative matrices and applies the 'moving edge' technique. Some simple examples of weighted paths and trees are presented to explain the results. Then, we propose some open problems in this area.
