Some observations on the smallest adjacency eigenvalue of a graph (Q2295999): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q209029
Created claim: Wikidata QID (P12): Q126413325, #quickstatements; #temporary_batch_1721943449312
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: David A. Gregory / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2997909010 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1912.03957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-BACKTRACKING RANDOM WALKS MIX FASTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs, partial geometries and partially balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extreme eigenvalues of regular graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius and the maximum degree of irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Rates of Random Walks with Little Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose least eigenvalue exceeds \(-1-\sqrt2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Good is the Goemans--Williamson MAX CUT Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional decompositions and the smallest-eigenvalue separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of subgraphs of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique coverings of graphs V: maximal-clique partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Cut and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755077 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126413325 / rank
 
Normal rank

Latest revision as of 22:49, 25 July 2024

scientific article
Language Label Description Also known as
English
Some observations on the smallest adjacency eigenvalue of a graph
scientific article

    Statements

    Some observations on the smallest adjacency eigenvalue of a graph (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2020
    0 references
    graph spectrum
    0 references
    smallest eigenvalue
    0 references
    adjacency matrix
    0 references
    graph decomposition
    0 references
    clique partition
    0 references
    claw-free graphs
    0 references
    maximum cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references