Irreversible k-threshold conversion number of some graphs

DOI10.1108/AJMS-07-2021-0150MaRDI QIDQ6203380FDOQ6203380

Ramy Shaheen, Suhail Mahfud, Ali Kassem

Publication date: 27 March 2024

Published in: Arab Journal of Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

Jahangir graph\(k\)-threshold conversion setgraph conversion processstrong grid graph

Mathematics Subject Classification ID

Epidemiology (92D30) Social networks; opinion dynamics (91D30) Graph theory (05C99)

Cites Work

• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Irreversible conversion of graphs
• Title not available (Why is that?)
• Irreversible 2-conversion set in graphs of bounded degree
• Domination in Jahangir graph J_{2,m}
• A method for eternally dominating strong grids
• Irreversible \(k\)-threshold conversion number of circulant graphs
• Title not available (Why is that?)
• The k-conversion number of regular graphs
• A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$

This page was built for publication: Irreversible k-threshold conversion number of some graphs

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