A vulnerability parameter of networks (Q2037692): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graphs with given connectivity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of integrity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination with exponential decay / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exponential domination of \(C_m\times C_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating domination, exponential domination, and porous exponential domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the exponential domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4977393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary equality of domination and exponential domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Porous exponential domination in Harary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Porous exponential domination number of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the group of the composition of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank

Revision as of 03:56, 26 July 2024

scientific article
Language Label Description Also known as
English
A vulnerability parameter of networks
scientific article

    Statements

    A vulnerability parameter of networks (English)
    0 references
    0 references
    0 references
    8 July 2021
    0 references
    network design and communication
    0 references
    graph vulnerability
    0 references
    domination
    0 references
    exponential domination
    0 references
    porous exponential domination
    0 references
    Cartesian product
    0 references
    lexicographic product
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references