The distance spectral radius of graphs with given number of odd vertices
2016 ◽
Vol 31
◽
pp. 286-305
◽
The graphs with smallest, respectively largest, distance spectral radius among the connected graphs, respectively trees with a given number of odd vertices, are determined. Also, the graphs with the largest distance spectral radius among the trees with a given number of vertices of degree 3, respectively given number of vertices of degree at least 3, are determined. Finally, the graphs with the second and third largest distance spectral radius among the trees with all odd vertices are determined.
2019 ◽
Vol 19
(04)
◽
pp. 2050068
Keyword(s):
2017 ◽
Vol 32
◽
pp. 438-446
◽
2016 ◽
Vol 488
◽
pp. 350-362
◽
2010 ◽
Vol 4
(2)
◽
pp. 269-277
◽
Keyword(s):
2008 ◽
Vol 458
(4-6)
◽
pp. 396-398
◽
2014 ◽
Vol 06
(01)
◽
pp. 1450014
◽
Keyword(s):