Open k-monopolies in graphs: complexity and related concepts
Open k-monopolies in graphs: complexity and related concepts
About this item
Full title
Author / Creator
Publisher
Discrete Mathematics & Theoretical Computer Science
Journal title
Language
English
Formats
Publication information
Publisher
Discrete Mathematics & Theoretical Computer Science
Subjects
More information
Scope and Contents
Contents
Closed monopolies in graphs have a quite long range of applications in
several problems related to overcoming failures, since they frequently have
some common approaches around the notion of majorities, for instance to
consensus problems, diagnosis problems or voting systems. We introduce here
open $k$-monopolies in graphs which are clo...
Alternative Titles
Full title
Open k-monopolies in graphs: complexity and related concepts
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_6f8b1f3bf11b44f6bf2d32b32a5aebea
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_6f8b1f3bf11b44f6bf2d32b32a5aebea
Other Identifiers
ISSN
1365-8050
E-ISSN
1365-8050
DOI
10.46298/dmtcs.654
