期刊文献+

Some results on covers of complete graphs

Some results on covers of complete graphs
原文传递
导出
摘要 In the present note, (n, r, c)-covers with n = (2r -1 )c and bipartite double covers of complete graphs are classified. In the present note, (n, r, c)-covers withn = (2r?1)c and bipartite double covers of complete graphs are classified.
作者 KWAK Jin Ho
机构地区 Mathematics
出处 《Chinese Science Bulletin》 SCIE EI CAS 2000年第9期796-798,共3页
关键词 COVER distance-regular GRAPH INTERSECTION ARRAY antipodal. cover distance-regular graph intersection array antipodal
  • 相关文献

参考文献4

  • 1C.D.Godsil,Algebraic Combinatorics.pvblished in Great Gritain by chapman and Hall[].London Journal.1993
  • 2BROUWER A E,COHEN A M,NEUMAIER A.Distance-regular Graphs[]..1989
  • 3Godsil,C.D.,Hensel,A.D.Distance regular covers of the complete graph[].Journal of Combin Th Ser B.1992
  • 4Hoffman,A. J.On the polynondal of a graph, Amer.Math[].Monthly.1963

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部