Elsevier, Linear Algebra and its Applications, 9(432), p. 2323-2334, 2010
DOI: 10.1016/j.laa.2009.06.008
Full text: Download
We consider the set of unicyclic graphs with prescribed degree sequence. In this set we determine the (unique) graph with the largest spectral radius (or index) with respect to the adjacency matrix. In addition, we give a conjecture about the (unique) graph with the largest index in the set of connected graphs with prescribed degree sequence.