A New Invariant Regarding Irreversible k-Threshold Conversion Processes on Some Graphs
An irreversible k-threshold conversion (k-conversion in short) process on a graph is a specific type of graph diffusion problems which particularly studies the spread of a change of state of the vertices of the graph starting with an initial chosen set while the conversion spread occurs acc...
Saved in:
| Main Authors: | Ali Kassem, Suhail Mahfud, Ramy Shaheen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2024-10-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/9271 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Basis Number of Symmetric Difference of K2 with Some Ladder Graphs
by: Ahmed Ali, et al.
Published: (2021-06-01) -
Threshold Protocol Game on Graphs with Magic Square-Generalization Labelings
by: Alexandra Fedrigo
Published: (2024-12-01) -
Emotion recognition in conversations based on discourse parsing and graph attention network
by: HAO Xiulan, et al.
Published: (2024-05-01) -
Emotion recognition in conversations based on discourse parsing and graph attention network
by: HAO Xiulan, et al.
Published: (2024-05-01) -
On the Seidel Laplacian spectrum of threshold graphs
by: Megha P M, et al.
Published: (2024-12-01)