Weighted Roman Domination in Graphs
Research Paper#Graph Theory, Bioinformatics, Computational Biology🔬 Research|Analyzed: Jan 3, 2026 19:50•
Published: Dec 27, 2025 15:26
•1 min read
•ArXivAnalysis
This paper introduces and studies the weighted Roman domination number in weighted graphs, a concept relevant to applications in bioinformatics and computational biology where weights are biologically significant. It addresses a gap in the literature by extending the well-studied concept of Roman domination to weighted graphs. The paper's significance lies in its potential to model and analyze biomolecular structures more accurately.
Key Takeaways
- •Introduces the concept of weighted Roman domination in graphs.
- •Addresses the need for weighted graph models in bioinformatics and computational biology.
- •Establishes bounds and realizability results for the weighted Roman domination number.
- •Determines exact values for specific graph families.
- •Demonstrates an equivalence between the weighted Roman domination number and the differential of a weighted graph.
Reference / Citation
View Original"The paper establishes bounds, presents realizability results, determines exact values for some graph families, and demonstrates an equivalence between the weighted Roman domination number and the differential of a weighted graph."