Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
DOI10.1007/S10878-014-9790-5zbMATH Open1333.05103OpenAlexW2045884405MaRDI QIDQ5963653FDOQ5963653
Chun-Ying Chiang, Hong-Gwa Yeh, Wei-Ting Huang
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9790-5
social networkstarget set selectionviral marketingfeedback vertex setdynamosirreversible \(k\)-threshold
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- Some results on the target set selection problem
- On the Approximability of Influence in Social Networks
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Target Set Selection Problem for Honeycomb Networks
- Automata, Languages and Programming
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Self-dual configurations and regular graphs
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Almost exact minimum feedback vertex set in meshes and butterflies
- Size bounds for dynamic monopolies
- Feedback vertex set in hypercubes
- Feedback vertex sets and cyclically reducible graphs
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- Decycling graphs
- On feedback vertex sets and nonseparating independent sets in cubic graphs
- Dynamic monopolies in tori.
- Dynamic monopolies of constant size
- Decycling Cartesian Products of Two Cycles
- Optimal irreversible dynamos in chordal rings
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Generalized Petersen graphs which are cycle permutation graphs
This page was built for publication: Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963653)