On graphs whose spread is maximal
Authors: Aleksić T., Petrović M.
Keywords: graph; cactus; spread; least eigenvalue; index
Abstract:
A graph’s spread is defined as the difference between the largest eigenvalue and the least eigenvalue of the graph’s adjacency matrix. Characterizing a graph with maximal spread is still a difficult problem. If we restrict the discussion to some classes of connected graphs of a prescribed order and size, it simplifies the problem and it may allow us to solve it. Here, we discuss some results on graphs whose spread is maximal in certain classes of graphs.
References:
[1] Aleksić, T.M., Petrović, M. Bicyclic graphs whose spread is maximal. Submitted to a journal
[2] Aleksić, T.M., Petrović, M. (2013) Cacti Whose Spread is Maximal. Graphs and Combinatorics, 31(1): 23-34
[3] Fan, Y.Z., Wang, Y., Gao, Y.B. (2008) Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread. Linear Algebra Appl, 429,(2-3),577-588
[4] Gregory, D.A., Hershkowitz, D., Kirkland, S.J. (2001) The spread of the spectrum of a graph. Linear Algebra Appl, 332-334, 23-25
[5] Petrović, M., Borovićanin, B., Aleksić, T. (2009) Bicyclic graphs for which the least eigenvalue is minimum. Linear Algebra and its Applications, 430(4): 1328-1335
[6] Petrović, M., Aleksić, T., Simić, S.K. (2011) Further results on the least eigenvalue of connected graphs. Linear Algebra and its Applications, 435(9): 2303-2313
[7] Petrović, M. (1983) On graphs whose spectral spread does not exceed 4. Publ. Inst. Math., Beograd, 34 (48) 169-174