Target set selection on generalized pancake graphs

DOI10.1007/S13226-020-0406-8MaRDI QIDQ2195642zbMATH OpenOpenAlexFDO

Authors Haining Jiang

Publication date 27 August 2020

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13226-020-0406-8

zbMATH Keywords

\(n\)-dimensional \(m\)-sided pancake graphfeedback vertex settarget set selection

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• Target set selection in Cartesian product graphs.
• On tractable cases of target set selection
• Some results on the target set selection problem
• Latency-bounded target set selection in social networks
• Target set selection problem for honeycomb networks

Cites work

• Almost exact minimum feedback vertex set in meshes and butterflies
• Combinatorial model and bounds for target set selection
• Constant thresholds can make target set selection tractable
• 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
• Fault-tolerant routing in burnt pancake graphs
• Girth of pancake graphs
• Group-theoretic algorithms and graph isomorphism
• scientific article; zbMATH DE number 6118220 (Why is no real title available?)
• scientific article; zbMATH DE number 1744105 (Why is no real title available?)
• Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
• 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 the approximability of influence in social networks
• Some results on the target set selection problem
• Target set selection problem for honeycomb networks

Cited in

(2)

• Target set selection in Cartesian product graphs.
• Target Set Selection in Dense Graph Classes

This page was built for publication: Target set selection on generalized pancake graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195642)