Dominator colorings of digraphs

M Cary - arXiv preprint arXiv:1902.07241, 2019 - arxiv.org
This paper serves as the first extension of the topic of dominator colorings of graphs to the
setting of digraphs. We establish the dominator chromatic number over all possible …

Cycle intersection graphs and minimum decycling sets of even graphs

M Cary - Discrete Mathematics, Algorithms and Applications, 2020 - World Scientific
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a
graph, and use the structure of these graphs to prove an upper bound for the decycling …

[PDF][PDF] On dynamic monopolies of cubic graphs

MA Fazli - The CSI Journal on Computer Science and …, 2017 - sina.sharif.edu
Majority based recoloring processes over graphs are used to model the spread of fault in
distributed computing and communication networks. We consider two of the most common …

[PDF][PDF] Decycling on zero divisor graphs of commutative ring

NM Rilwan, R Radha - AIP Conference Proceedings, 2020 - researchgate.net
Decycling on zero divisor graphs of commutative ring Page 1 AIP Conference Proceedings
2261, 030038 (2020); https://doi.org/10.1063/5.0016962 2261, 030038 © 2020 Author(s) …

[HTML][HTML] Open Journal of Discrete Applied Mathematics Vol. 3 (2020), Issue 2, pp. 50–67

M Cary - pisrt.org
This paper serves as the first extension of the topic of dominator colorings of graphs to the
setting of digraphs. We establish the dominator chromatic number over all possible …

[PDF][PDF] On the Spread of Influence through Cubic Networks

There are two famous models which are proposed for the spread of influence in social
networks, the progressive strict majority model and the non-progressive strict majority model; …