No article text was recorded for this version.
spectral independent set bounding
Version 1 of 110 papers24 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
- Blog: The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds
- Blog: Counting sum-free sets in Abelian groups
- Blog: Measure-theoretic bounds on the spectral radius of graphs from walks
- Blog: Estrada index and subgraph centrality of hypergraphs via tensors
- Blog: A homogeneous polynomial associated with general hypergraphs and its applications
- Blog: Maximization of the spectral radius of block graphs with a given dissociation number
- Blog: The maximum Aα-spectral radius of t-connected graphs with bounded matching number
- Blog: Hermitian adjacency matrices with at most three distinct eigenvalues
- Blog: Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_spectral_independent_set_bounding_6f980304,
title = {spectral independent set bounding},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-independent-set-bounding/rdr_6f98030440d540939ce900c91fbbb08f},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_spectral_independent_set_bounding_6f980304_v1,
title = {spectral independent set bounding},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-independent-set-bounding/rdr_6f98030440d540939ce900c91fbbb08f/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}