Edge-size conjecture for diameter-2, 3_t-critical graphs
Statement
Let be a simple graph of order . A graph is -critical if its total domination number is and adding an edge between any nonadjacent vertices lowers its total domination number. Suppose in addition that has diameter , and let denote its number of edges. Edge-size conjecture for diameter-2, -critical graphs. Then
A proof of this conjecture would, according to the source, imply the Murty–Simon conjecture together with the cited results for the diameter-3 case; the supplied text does not state that it has been resolved.
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.