具有最大菱形数竞赛图的矩阵刻画
Matricial characterization of tournaments with maximum number of diamonds
摘要:
菱形是一个$4$ -竞赛图,它由一个支配或被一个$3$ -圈支配的顶点组成。在斜会议矩阵存在的条件下,给出了当$n\equiv0\pmod{4}$和$n\equiv3\pmod{4}$满足最大菱形数时$n$ -竞赛图的一个完整刻画.对于$n\equiv2\pmod{4}$,我们得到了$n$ -竞赛图中钻石个数的一个上界,并给出了达到这个上界的竞赛图的一个矩阵特征.
英文摘要:
A diamond is a $4$-tournament which consists of a vertex dominating or dominated by a $3$-cycle. Assuming the existence of skew-conference matrices, we give a complete characterization of $n$-tournaments with the maximum number of diamonds when $n\equiv0\pmod{4}$ and $n\equiv3\pmod{4}$. For $n\equiv2\pmod{4}$, we obtain an upper bound on the number of diamonds in an $n$-tournament and we give a matricial characterization of tournaments achieving this bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。