Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size
暂无分享,去创建一个
[1] I. G. Zorin.,et al. A. I. IN THE UKRAINE. , 1957 .
[2] C. T. Benson. Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.
[3] Luigi A. Rosati,et al. Buildings and the Geometry of Diagrams , 1986 .
[4] Alfred Weiss. Girths of bipartite sextet graphs , 1984, Comb..
[5] F. Bien. Constructions of telephone networks by group representations , 1989 .
[6] Norman L. Biggs,et al. Note on the girth of Ramanujan graphs , 1990, J. Comb. Theory, Ser. B.
[7] William M. Kantor,et al. Generalized polygons, SCABs and GABs , 1986 .
[8] Miklós Simonovits,et al. On a class of degenerate extremal graph problems , 1983, Comb..
[9] Norman Biggs,et al. The sextet construction for cubic graphs , 1983, Comb..
[10] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[11] Brendan D. McKay,et al. A nine point theorem for 3-connected graphs , 1982, Comb..
[12] M. Murty. Ramanujan Graphs , 1965 .
[13] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[14] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .
[15] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[16] Felix Lazebnik,et al. New Examples of Graphs without Small Cycles and of Large Size , 1993, Eur. J. Comb..