摘要
设n≥5,D为n阶强连通竞赛图,本文给出了本原指数达到次大值n+1的极图的完全刻画.
Let D be the disconnected tournament on n vertices (n ≥ 5). We prove a complete characterization of the tournament with primitive exponent reaching its secondary value n + 1.
基金
福建省教育厅科研基金(JB03144)
关键词
竞赛图
本原指数
极图
次大值
tournament
primitive exponent
extreme digraph
secondary value.