The domination-number conjecture for total graphs of finite rings
Statement
Let be an arbitrary ring with Jacobson radical , and suppose that
where each is a finite field and for all . For a finite ring , let denote its total graph and let denote the domination number of that graph. Domination-number conjecture.
The preceding theorem establishes the corresponding upper bound without the restrictions . The examples of and attain this bound, while factors with can give a strictly smaller domination number; the equality in the stated generality is therefore proposed but not established here.
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.