A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph (Q952070): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828550 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Signless Laplacians of finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eigenvalue bounds for the signless laplacian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Which graphs are determined by their spectrum? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of the smallest eigenvalue of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing algebraic connectivity over connected graphs with fixed girth / rank | |||
Normal rank |
Latest revision as of 18:46, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph |
scientific article |
Statements
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph (English)
0 references
6 November 2008
0 references
graph theory
0 references
graph spectra
0 references
line graph
0 references
signless Laplacian
0 references
least eigenvalue
0 references