On the connectivity of \(p\)-diamond-free vertex transitive graphs (Q423953): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6039499 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
connectivity | |||
| Property / zbMATH Keywords: connectivity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
superconnected | |||
| Property / zbMATH Keywords: superconnected / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex transitive graphs | |||
| Property / zbMATH Keywords: vertex transitive graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
diamond-free graphs | |||
| Property / zbMATH Keywords: diamond-free graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(p\)-diamond-free graphs | |||
| Property / zbMATH Keywords: \(p\)-diamond-free graphs / rank | |||
Normal rank | |||
Revision as of 22:19, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the connectivity of \(p\)-diamond-free vertex transitive graphs |
scientific article |
Statements
On the connectivity of \(p\)-diamond-free vertex transitive graphs (English)
0 references
30 May 2012
0 references
connectivity
0 references
superconnected
0 references
vertex transitive graphs
0 references
diamond-free graphs
0 references
\(p\)-diamond-free graphs
0 references
