Spectral upper bounds on the size of k-regular induced subgraphs (Q2839204): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximum \(k\)-regular induced subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equitable bipartitions of graphs and related results / 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: Q3184855 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank | |||
Normal rank | |||
Latest revision as of 14:15, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spectral upper bounds on the size of k-regular induced subgraphs |
scientific article |
Statements
Spectral upper bounds on the size of k-regular induced subgraphs (English)
0 references
4 July 2013
0 references
programming involving graphs
0 references
graph spectra
0 references
independent sets
0 references
induced matchings
0 references
2-factors
0 references
