The eavesdropping number of a graph (Q3070149): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10587-009-0056-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10587-009-0056-9 / rank | |||
Normal rank | |||
Latest revision as of 15:30, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The eavesdropping number of a graph |
scientific article |
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
