Eigenvalue bounds for the signless laplacian-Reference-Cited by-同舟云学术

Eigenvalue bounds for the signless laplacian

Published:2007 Issue:95 Volume: Page:11-27
ISSN:0350-1302
Container-title:Publications de l'Institut Math?matique (Belgrade)
language:en
Short-container-title:Publ Inst Math (Belgr)

Author:

Cvetkovic Dragos¹,Rowlinson Peter²,Simic Slobodan¹

Affiliation:

1. Matematički institut SANU, Beograd

2. Department of Computing Science and Mathematics, Stirling, Scotland

Abstract

We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.

Publisher

National Library of Serbia

Subject

General Mathematics

Reference13 articles.

1. Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system

2. Signless Laplacians and line graphs

3. Signless Laplacians of finite graphs

4. Which graphs are determined by their spectrum?

5. Graph homomorphisms and nodal domains

Cited by 126 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maxima of the Q-index for 3K3-free graphs;Discrete Applied Mathematics;2024-12

2. Distribution of signless Laplacian eigenvalues and graph invariants;Linear Algebra and its Applications;2024-10

3. The signless Laplacian spectral radius of 2K3-free graphs;Discrete Mathematics;2024-09

4. Signless Laplacian spectrum of a graph;Linear Algebra and its Applications;2024-02

5. Graph Limits and Spectral Extremal Problems for Graphs;SIAM Journal on Discrete Mathematics;2024-01-31