Partitioning a graph into defensive \(k\)-alliances (Q546272): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57974377, #quickstatements; #temporary_batch_1719448105926
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powerful alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global alliances and independence in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive \(r\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral study of alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global alliances in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complement graph and defensive \(k\)-alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defensive alliances and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global offensive alliance number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alliance partition number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric Inequalities and Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph laplacians / rank
 
Normal rank

Latest revision as of 04:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into defensive \(k\)-alliances
scientific article

    Statements

    Partitioning a graph into defensive \(k\)-alliances (English)
    0 references
    24 June 2011
    0 references
    defensive alliances
    0 references
    dominating sets
    0 references
    domination
    0 references
    isoperimetric number
    0 references

    Identifiers