Bounds on a graph's security number (Q2476256): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Unfriendly partitions of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powerful alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4662347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211331 / rank
 
Normal rank

Latest revision as of 19:44, 27 June 2024

scientific article
Language Label Description Also known as
English
Bounds on a graph's security number
scientific article

    Statements

    Bounds on a graph's security number (English)
    0 references
    0 references
    18 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    defensive alliances
    0 references
    secure sets
    0 references
    extremal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references