Akbari et al.'s upper-bound conjecture for edge Roman domination
Statement
Let be a simple graph of maximum degree on vertices. An edge Roman dominating function is a function such that every edge assigned is adjacent to an edge assigned , and the edge Roman domination number is the minimum weight of such a function.
Akbari et al.'s conjecture.
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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.