ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a symmetric directed graph on mm vertices, with corresponding adjacency matrix

(e11e12…e1me21e21…e2m\hdotsfor4em1em2 …emm).\begin{pmatrix} e_{11} & e_{12} & \dots & e_{1m}\\ e_{21} & e_{21} & \dots & e_{2m}\\ \hdotsfor{4}\\ e_{m1} & e_{m2} & \ \dots & e_{mm} \end{pmatrix}.

Kyle graph characterization conjecture. The graph DD is a Kyle graph if and only if all of the following conditions hold: (i) mm is odd and m=2al+1m=2a_l+1, where ala_l is determined by Ratanang's Theorem; (ii) eii=0e_{ii}=0 for every ii; (iii) ei(i+1)+e(i+1)i=ej(j+1)+e(j+1)je_{i(i+1)}+e_{(i+1)i}=e_{j(j+1)}+e_{(j+1)j} for 1≤i,j≤m−11\leq i,j\leq m-1; (iv) in row (e1j)(e_{1j}), e12≥e13≥⋯≥e1⌊m/2⌋=1e_{12}\geq e_{13}\geq\cdots\geq e_{1\lfloor m/2\rfloor}=1 and e1j=0e_{1j}=0 for ⌊m/2⌋+1≤j≤m\lfloor m/2\rfloor+1\leq j\leq m; and (v) in column (ej1)(e_{j1}), e21=e31=⋯=e(⌊m/2⌋−1)1=1e_{21}=e_{31}=\cdots=e_{(\lfloor m/2\rfloor-1)1}=1 and ej1=0e_{j1}=0 for ⌊m/2⌋≤j≤m\lfloor m/2\rfloor\leq j\leq m. This is presented as an open problem concerning the characterization of Kyle graphs within the class of symmetric directed graphs; the notation ala_l 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.