The eavesdropping number of a graph (Q3070149)
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: The eavesdropping number of a graph |
scientific article; zbMATH DE number 5844056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The eavesdropping number of a graph |
scientific article; zbMATH DE number 5844056 |
Statements
The eavesdropping number of a graph (English)
0 references
2 February 2011
0 references
eavesdropping number
0 references
edge connectivity
0 references
maximally locally connected
0 references
Cartesian product
0 references
vertex disjoint paths
0 references
0 references
0 references
0.7266400456428528
0 references
0.7109424471855164
0 references
0.7094766497612
0 references
