完全四部图K_(n,n,n,n)(n为偶数)的竞赛数
The competition numbers of complete tetrapartite graphs K_(n,n,n,n) where n is even
摘要
本文利用ECC来给出关于完全四部图Kn,n,n,n(n为偶数)的竞赛数的一些结果:k(Kn,n,n,n){=2,当n=2;≤n2-7n/2+7,当n=2m+2(m=1,2,…).
In this paper,the results about the competition numbers of complete tetrapartite graphs Kn,n,n,n are given where n is even by ECC as follows：k（Kn,n,n,n）{=2, for n=2;≤n2-7n/2＋7, for n=2m＋2（m=1,2,…）
出处
《河北省科学院学报》
CAS
2009年第4期6-10,共5页
Journal of The Hebei Academy of Sciences
关键词
竞赛图
竞赛数
完全四部图Kn
N
Competition graph
Competition number
Complete tetrapartite graphs Kn
n
参考文献15
-
1J. E. Cohen. Interval graphs and food webs,A finding and a problem[J]. Document 17696--PR,RAND Corporation Santa Monica , CA, 1968.
-
2C. Cable, K. F. Jones,J. R. Lundgren, S. Seager. Niche graphs[J]. Discrete Appl. Math. 1989, (23) : 231 -- 241.
-
3P. C. Fishburn,W. V. Gehrlein. Niche numbers[J].J. Graph Theory. 1992, ( 16), 131-- 139.
-
4S. R. Kim. The competition number and its variants[Z], in:J. Gimbel,J. W. Kennedy,L. V. Quintas(Eds. ) ,Quo Vadis,Graph Theory,in:Annals of Discrete Mathematics,North-Holland B. V,Amsterdam,The Netherlands,1993,55:313--326.
-
5S. R. Kim, F. S. Roberts. Competition numbers of graphs with a small number of triangles[J]. Discrete Appl. Math. 1997,78:153 --162.
-
6J. R. Lundgren. Food webs, competition graphs competition-common enemy graphs, and Niche graphs, in:F. S. Roberts(Ed. ), Applications of Combinatorics and Graph Theory to the Biological and Social Sciences,in:IMH Volumes in Mathematics and its Application, Springer, New York, 1989,17:221 -- 243.
-
7D. Scott. The competition-common enemy graph of a digraph[J]. Discrete Appl. Math. 1987,17:269--280.
-
8F. S. Roberts. Food webs, competition graphs, and the boxicity of ecological phase space, in: Y. Alavi, D. Lick(Eds. ), Theory and Applications of Graphs, Springer, New York, 1978,477 - 490.
-
9C.E. Shannon. The zero capacity of a noisy channel,IRE Trans. Inform Theory IT--2 1956,8--19.
-
10M. B. Cozzens. F. S. Roberts, T-colorings of graphs and the channel assignment problem[J]. Congr. Numer. 1982,25 z 191 -- 208.
二级参考文献7
-
1J.E.Cohen.Interval graphs and food webs;a finding and a problem,Document 17696-PR,RAND Corporation Santa Monica,CA(1968).
-
2J.E.Cohen.Food webs and Niche space.Princeton University Press,Princeton,NJ(1978).
-
3R.D.Dutton,and R.C.Brigham.A characterization of competition graphs[J].Discrete Appl.Math.1983,(6):315-317.
-
4S.R.kim,Y.Sano.The competition numbers of complete tripartite graphs[J].Submite to DAM.2008.
-
5R.J.Opsut.On the computation of the competition number of a graph[J].SIAM J.Algebraic Discrete Methods 1982,(3):420-428.
-
6F.S.Roberts.Food weds,competition graphs and the boxicity of ecological phase space,Theory and applications of graphs(Proc.Internat.Conl.,Western Mich.Univ.,Kalamazoo,Mich.,1976),1978,477-490.
-
7F.S.Roberts.Applications of edge coverings by cliques[J].Discrete Appl.Math.1985,(10):93-109.
