Characterization of Kyle graphs among symmetric directed graphs
Statement
Let be a symmetric directed graph on vertices, with corresponding adjacency matrix
Kyle graph characterization conjecture. The graph is a Kyle graph if and only if all of the following conditions hold: (i) is odd and , where is determined by Ratanang's Theorem; (ii) for every ; (iii) for ; (iv) in row , and for ; and (v) in column , and for . This is presented as an open problem concerning the characterization of Kyle graphs within the class of symmetric directed graphs; the notation and Ratanang's Theorem are not defined in the supplied context.
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.