A neigborhood union condition for nonadjacent vertices in graphs (Q4595248)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A neigborhood union condition for nonadjacent vertices in graphs |
scientific article; zbMATH DE number 6813643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A neigborhood union condition for nonadjacent vertices in graphs |
scientific article; zbMATH DE number 6813643 |
Statements
A neigborhood union condition for nonadjacent vertices in graphs (English)
0 references
29 November 2017
0 references
bipartite
0 references
cycle
0 references
\(N\)-bounded graph
0 references
neighborhood
0 references
0 references
0.7141820788383484
0 references
0.7119439840316772
0 references
0.703997790813446
0 references
