Partitioning a graph into global powerful \(k\)-alliances (Q1926038): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ismael González Yero / rank
 
Normal rank
Property / author
 
Property / author: Juan Alberto Rodríguez-Velázquez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-011-1065-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040454935 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57974355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global offensive \(k\)-alliances in graphs / 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: Q4897506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620532 / 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: Q4470237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / 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: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defensive \(k\)-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: Global defensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive alliances in cubic 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: Q5488895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405794 / 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: Partitioning a graph into offensive \(k\)-alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into defensive \(k\)-alliances / rank
 
Normal rank

Latest revision as of 01:08, 6 July 2024

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

    Statements

    Partitioning a graph into global powerful \(k\)-alliances (English)
    0 references
    27 December 2012
    0 references
    0 references
    defensive \(k\)-alliances
    0 references
    offensive \(k\)-alliances
    0 references
    powerful \(k\)-alliances
    0 references
    Cartesian product graphs
    0 references
    0 references
    0 references