The average scattering number of graphs (Q2956887): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number and modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average connectivity of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between scattering number and other vulnerability parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number in graphs / rank
 
Normal rank

Revision as of 07:25, 13 July 2024

scientific article
Language Label Description Also known as
English
The average scattering number of graphs
scientific article

    Statements

    The average scattering number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2017
    0 references
    connectivity
    0 references
    rupture degree
    0 references
    scattering number
    0 references
    average lower domination number
    0 references
    average lower independence number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references