首页 | 本学科首页   官方微博 | 高级检索  
     

强正则自补图的一个注记
引用本文:田方. 强正则自补图的一个注记[J]. 数学季刊, 2006, 21(1): 62-65
作者姓名:田方
作者单位:Department of Applied Mathematics,Shanghai University of Finance and Economics,Shanghai 200135,China
基金项目:Supported by the NNSF of China(10271114)
摘    要:Kotzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongly-regular self- complementary graph whose order is 4k 1, where 4k 1=x2 y2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k 1 orders.

关 键 词:规则自补充图表  特征值  循环图表  图论

A Note on Strongly Regular Self-complementary Graphs
TIAN Fang. A Note on Strongly Regular Self-complementary Graphs[J]. Chinese Quarterly Journal of Mathematics, 2006, 21(1): 62-65
Authors:TIAN Fang
Affiliation:Department of Applied Mathematics, Shanghai University of Finance and Economics, Shanghai 200135,China
Abstract:Kotzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongly-regular self- complementary graph whose order is 4k 1, where 4k 1=x2 y2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k 1 orders.
Keywords:strongly regular self-complementary graphs  strongly edge triangle regular  eigenvalues  circular graphs
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号