Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

DOI10.1007/S10878-014-9790-5MaRDI QIDQ5963653zbMATH OpenOpenAlexFDO

Authors Chun-Ying Chiang, Wei-Ting Huang, Hong-Gwa Yeh

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

zbMATH Keywords

social networkstarget set selectionviral marketingfeedback vertex setdynamosirreversible \(k\)-threshold

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• The decycling number of generalized Petersen graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• Decycling number and upper-embeddibility of generalized Petersen graphs
• scientific article; zbMATH DE number 1744105
• Decycling of Fibonacci cubes

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 1003266 (Why is no real title available?)
• scientific article; zbMATH DE number 1744105 (Why is no real title available?)
• scientific article; zbMATH DE number 1443271 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• scientific article; zbMATH DE number 3318502 (Why is no real title available?)
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Almost exact minimum feedback vertex set in meshes and butterflies
• Automata, Languages and Programming
• Combinatorial model and bounds for target set selection
• Contamination and decontamination in majority-based systems
• Decycling Cartesian Products of Two Cycles
• Decycling graphs
• Dynamic monopolies and feedback vertex sets in hexagonal grids
• Dynamic monopolies in tori.
• Dynamic monopolies of constant size
• Feedback vertex set in hypercubes
• Feedback vertex sets and cyclically reducible graphs
• Generalized Petersen graphs which are cycle permutation graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Local majorities, coalitions and monopolies in graphs: A review
• On dynamic monopolies of graphs with general thresholds
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• On the approximability of influence in social networks
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• On time versus size for monotone dynamic monopolies in regular topologies
• Optimal irreversible dynamos in chordal rings
• Self-dual configurations and regular graphs
• Size bounds for dynamic monopolies
• Some results on the target set selection problem
• Target set selection problem for honeycomb networks
• Treewidth governs the complexity of target set selection

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)