EventsThe 2nd International Online Conference on Mathematics and Applications
Published
This submission belongs to the session S1. Algebra, Geometry, Topology and Logic with Applications of the event The 2nd International Online Conference on Mathematics and Applications
Published date
04 Jun, 2026
Academic Editor
author-avatarIrina Cristea
Citation
Nasir Ali, Muhammad Imran Qureshi, Hafiz Muhammad Afzal Siddiqui, Mubarrah Tariq, Fahad Sameer Alshammari, Optimizing Emergency-Station Placement through Roman and Double Roman Domination in Zero-Divisor Graphs of Finite Rings, in Proceedings of The 2nd International Online Conference on Mathematics and Applications, 10 June–12 June 2026, MDPI: Basel, Switzerland
Share
Email
Facebook
Twitter
LinkedIn

Optimizing Emergency-Station Placement through Roman and Double Roman Domination in Zero-Divisor Graphs of Finite Rings

image
Muhammad Imran Qureshi 1
1. Department of Mathematics, COMSATS University Islamabad, Vehari Campus, Vehari, 61100, Pakistan, Pakistan
2. Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore, 54000, Pakistan, Pakistan
3. Department of Mathematics, College of Science and Humanities in Alkharj, Prince Sattam bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia, Saudi Arabia
Abstract

Zero-divisor graphs provide a powerful bridge between commutative algebra and graph theory by encoding annihilation relationships among zero divisors of a finite ring. While parameters such as connectivity, chromatic number, and classical domination have been extensively explored, Roman domination and double Roman domination in zero-divisor graphs remain largely uncharacterized. These parameters model optimal resource allocation under different levels of protection and redundancy. This study aims to compute and analyze the Roman domination number and the double Roman domination number for key families of finite commutative rings and to establish structural relationships between algebraic properties of rings and optimal domination behavior.

Methods:
For each selected ring family, zero-divisor graphs are constructed from annihilation relations. Roman and double Roman domination are formulated as constrained optimization problems, supported by algebraic–graph theoretic lemmas, degree-based bounds, and annihilator structure analysis. Exact values are obtained using integer linear programming (ILP), while large graphs are studied using heuristic algorithms informed by neighborhood structures and annihilator classes.

Results:
Preliminary analyses reveal that vertices with maximal annihilator degree play a central role in optimal Roman and double Roman labelings. Structural features such as star-like patterns, complete subgraphs, and decompositions from the Chinese Remainder Theorem significantly reduce domination cost. Across ring families, distinct algebraic characteristics—particularly annihilator chains and idempotent behavior—strongly influence domination numbers.

Conclusion:
This work establishes new theoretical bounds, exact values, and structural characterizations of Roman and double Roman domination in zero-divisor graphs. These findings also support an application framework interpreting domination assignments as minimum-cost emergency-station placement strategies, demonstrating the practical relevance of the studied parameters.

Keywords
Zero-divisor graph
Roman domination
Double Roman domination
Finite commutative rings
Annihilator structure
Graph optimization
Integer linear programming (ILP)
Emergency-station allocation
Resource minimization
Algebraic graph theory
Poster
IOCMA2026 Poster Dr Nasir.pdf
Mathematical Proof of the Existence of Intrinsic Spatial Mass: A Rigorous Framework Based on Discrete Groups and Complex Linear Spaces
Structural Identities Determined by Prime Ideals through Generalized P-Derivations