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


On a Decomposition of Complete Graphs
Authors:H.?Kharaghani  author-information"  >  author-information__contact u-icon-before"  >  mailto:hadi@cs.uleth.ca"   title="  hadi@cs.uleth.ca"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,R.?Torabi
Affiliation:(1) Department of Mathematics & Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K 3M4, Canada;(2) Institute for Studies in Theoretical Physics and Mathematics, IPM, P.O.Box 19395-5746, Tehran , Iran
Abstract:It is shown, among other results, that for any prime power q, the complete graph on 1+q+q 2+q 3 vertices can be decomposed into a union of 1+q Siamese Strongly Regular Graphs S R G(1+q+q 2+q 3,q+q 2,q–1,q+1) sharing 1+q 2 cliques of size 1+q. Acknowledgments.enspThe authors are indebted to a referee for a very extensive report and for many suggestions which improved the presentation of the paper tremendously.AMS Subject Numbers: 05B05, 05B20, 05E30This work was completed while the first author was on sabbatical leave visiting Institute for studies in theoretical Physics and Mathematics, (IPM), in Tehran, Iran. Support and hospitality is appreciated. Supported by an NSERC operating grant.
Keywords:Symmetric design  Difference set  Strongly regular graph  Balanced generalized weighing matrix  Complete graph
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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