Edge Roman domination on graphs
Gerard J. Chang, Sheng-Hua Chen, and Chun-Hung Liu

TL;DR
This paper investigates the edge Roman domination number in various graph classes, disproves a prior conjecture, and establishes new upper bounds, including for planar, k-degenerate, and girth-restricted graphs.
Contribution
It provides counterexamples to a conjecture on maximum degree bounds and introduces several sharp upper bounds for different graph families.
Findings
Disproves a conjecture on maximum degree and edge Roman domination.
Establishes a new upper bound for connected graphs.
Proves a sharp upper bound for subcubic and planar graphs.
Abstract
An edge Roman dominating function of a graph is a function satisfying the condition that every edge with is adjacent to some edge with . The edge Roman domination number of , denoted by , is the minimum weight of an edge Roman dominating function of . This paper disproves a conjecture of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi and Sadeghian Sadeghabad stating that if is a graph of maximum degree on vertices, then . While the counterexamples having the edge Roman domination numbers , we prove that is an upper bound for connected graphs. Furthermore, we provide an upper bound for the edge Roman domination…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Optimization and Search Problems · Complexity and Algorithms in Graphs
