New feasibility conditions for directed strongly regular graphs (Q510327): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than \(k\), the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets. | |||
| Property / review text: Summary: We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than \(k\), the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05E30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6686269 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
directed strongly regular graph | |||
| Property / zbMATH Keywords: directed strongly regular graph / rank | |||
Normal rank | |||
Revision as of 03:39, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New feasibility conditions for directed strongly regular graphs |
scientific article |
Statements
New feasibility conditions for directed strongly regular graphs (English)
0 references
17 February 2017
0 references
Summary: We prove two results for directed strongly regular graphs that have an eigenvalue of multiplicity less than \(k\), the common out-degree of each vertex. The first bounds the size of an independent set, and the second determines an eigenvalue of the subgraph on the out-neighborhood of a vertex. Both lead to new nonexistence results for parameter sets.
0 references
directed strongly regular graph
0 references
