Connected positive influence dominating set in k-regular graph

DOI10.1016/J.DAM.2020.08.010MaRDI QIDQ2004078zbMATH OpenOpenAlexFDO

Authors Xiaopeng Yao, H.-J. Huang, Hongwei Du

Publication date 14 October 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.08.010

zbMATH Keywords

\(k\)-regular graphconnected dominating setcubic graphtwo hop

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A greedy algorithm for the connected positive influence dominating set in k-regular graphs
• On positive influence dominating sets in social networks
• Positive influence domination in graphs
• On the approximability of positive influence dominating set in social networks
• Connected domination of regular graphs

Cites work

• Approximation algorithm for partial positive influence problem in social network
• New dominating sets in social networks
• On general threshold and general cascade models of social influence
• On positive influence dominating sets in social networks
• On the approximability of positive influence dominating set in social networks
• Positive Influence Dominating Set in Online Social Networks

Cited in

(2)

• Positive influence domination in graphs
• A greedy algorithm for the connected positive influence dominating set in k-regular graphs

This page was built for publication: Connected positive influence dominating set in \(k\)-regular graph

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