Max-cut and extendability of matchings in distance-regular graphs (Q518196): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6697641 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(t\)-extendable connected graph | |||
| Property / zbMATH Keywords: \(t\)-extendable connected graph / rank | |||
Normal rank | |||
Revision as of 04:41, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max-cut and extendability of matchings in distance-regular graphs |
scientific article |
Statements
Max-cut and extendability of matchings in distance-regular graphs (English)
0 references
28 March 2017
0 references
\(t\)-extendable connected graph
0 references
