The eavesdropping number of a graph (Q3070149)

From MaRDI portal
Revision as of 15:30, 20 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers