Irreversible k-Threshold Conversion Number of Circulant Graphs
An irreversible conversion process is a dynamic process on a graph where a one-way change of state (from state 0 to state 1) is applied on the vertices if they satisfy a conversion rule that is determined at the beginning of the study. The irreversible k-threshold conversion process on a graph G=V,E...
Saved in:
Main Authors: | Ramy Shaheen, Suhail Mahfud, Ali Kassem |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2022/1250951 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Eternal Domination of Generalized Petersen Graph
by: Ramy Shaheen, et al.
Published: (2021-01-01) -
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
by: Ramy Shaheen, et al.
Published: (2020-01-01) -
Microscopic irreversibility
by: Karl Gustafson
Published: (2004-01-01) -
On k-Distance Pell Numbers in 3-Edge-Coloured Graphs
by: Krzysztof Piejko, et al.
Published: (2014-01-01) -
Metric Dimension Threshold of Graphs
by: Meysam Korivand, et al.
Published: (2022-01-01)