Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q244945
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ismael González Yero / 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.7151/dmgt.2017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2765585216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerance in Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2811818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time versus size for monotone dynamic monopolies in regular topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to assign votes in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of monopolies in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the (k-)monopoly number of direct product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4591109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open k-monopolies in graphs: complexity and related concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Monopoly in Regular and Tree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic monopolies of graphs with general thresholds / rank
 
Normal rank

Latest revision as of 21:52, 14 July 2024

scientific article
Language Label Description Also known as
English
Bounding the open \(k\)-monopoly number of strong product graphs
scientific article

    Statements

    Bounding the open \(k\)-monopoly number of strong product graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2018
    0 references
    open monopolies
    0 references
    strong product graphs
    0 references
    alliances
    0 references
    domination
    0 references

    Identifiers