A characterization of the components of the graphs D(k, q)

Discrete Mathematics

Volumn 157, Issue 1-3, 1996, Pages 271-283

  Lazebnik, F ^a   Ustimenko, V A ^b   Woldar, A J ^c  

^a UNIVERSITY OF DELAWARE   (United States)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

^c VILLANOVA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003060660     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)83019-6     Document Type: Article

References (11)

1. N.L. Biggs, Graphs with large girth, Ars Combin. 25-C (1988) 73-80.
2. B. Bollobás, Extremal Graph Theory (Academic Press, London, 1978).
3. Z. Füredi, F. Lazebnik, Á. Seress, V.A. Ustimenko and A.J. Woldar, Graphs of prescribed girth and bi-degree, J. Combin. Theory Ser. B 64 (1995) 228-239.
4. F. Lazebnik and V.A. Ustimenko, Explicit construction of graphs with an arbitrary large girth and of large size, Appl. Discrete Appl. Math. 60 (1995) 275-284.
5. F. Lazebnik and V.A. Ustimenko, New examples of graphs without small cycles and of large size, Europ. J. Combin. 14 (1993) 445-460.
6. F. Lazebnik, V.A. Ustimenko and A.J. Woldar, A new series of dense graphs of large girth, Bull. Amer. Math. Soc. 32 (1995) 73-79.
7. F. Lazebnik, V.A. Ustimenko and A.J. Woldar, A new series of dense graphs of large girth, Rutcor Research Report RRR 99-93, December 1993.
8. A. Lubotzky, R. Philips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261-277.
9. G.A. Margulis, Explicit group - theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators, J. Prob. Informat. Transm. (1988) 39-46. (translation from Problemy Peredachi Informatsii 24 (1988) 51-60).
10. G.A. Margulis, Explicit group - theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators, J. Prob. Informat. Transm. (1988) 39-46. (translation from Problemy Peredachi Informatsii 24 (1988) 51-60).
11. A. Schliep, GADAR and its application to extremal graph theory, Masters Thesis, University of Delaware, 1994.