ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph of maximum degree Δ\Delta on nn vertices. An edge Roman dominating function is a function f ⁣:E(G)→{0,1,2}f\colon E(G)\to\{0,1,2\} such that every edge assigned 00 is adjacent to an edge assigned 22, and the edge Roman domination number γR′(G)\gamma'_R(G) is the minimum weight ∑e∈E(G)f(e)\sum_{e\in E(G)}f(e) of such a function.

Akbari et al.'s conjecture.

γR′(G)≤⌈ΔΔ+1n⌉.\gamma'_R(G)\leq\left\lceil\frac{\Delta}{\Delta+1}n\right\rceil.

This conjecture seeks an upper bound for edge Roman domination in terms of the order and maximum degree of the graph, rather than its number of edges. The supplied text gives the preceding weaker bound γR′(G)≤2Δ2Δ+1n\gamma'_R(G)\leq\frac{2\Delta}{2\Delta+1}n but provides no resolution of the conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.