Line-middle graph inequality conjecture for outer-connected domination
Statement
Let be a graph of order , and let and denote its line graph and middle graph, respectively. The line-middle graph inequality conjecture asserts that
The inequality is supported by the preceding results, including strict inequality for wheels of order at least five; equality occurs for at least one connected graph of order four. A classification of graphs for which equality holds is posed separately as an open problem, while the general inequality remains open.
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.