General properties of some families of graphs defined by systems of equations

Journal of Graph Theory

Volumn 38, Issue 2, 2001, Pages 65-86

  Lazebnik, Felix ^a   Woldar, Andrew J ^b  

^a UNIVERSITY OF DELAWARE   (United States)

^b VILLANOVA UNIVERSITY   (United States)

Author keywords

Bipartite double; Cover of a graph; Edge decomposition; Embedded spectra; Girth; Neighborhood complete coloring; Polarity graph; Star complete coloring

Indexed keywords

EID: 31244432447     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1024     Document Type: Article

References (51)

1. L. M. Batten, Combinatorics of Finite Geometries, Cambridge Univ Press, Cambridge, 1986.
2. C. T. Benson, Minimal regular graphs of girths eight and twelve, Can J Math 18 (1966), 1091-1094.
3. J. A. Bondy, and M. Simonovits, Cycles of even length in graphs, J Combin Theory, Series B 16 (1974), 97-105.
4. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.
5. W. G. Brown, On graphs that do not contain a Thomsen graph, Can Math Bull 9 (1966), 281-285.
6. D. de Caen and L. A. Székely, The maximum size of cedings 4- and 6-cycle free bipartite graphs on m, n vertices, in Graphs, Sets and Numbers, Proceedings of the Conference Dedicated to the 60th Birthdays of A. Hajnal and Vera T. Sós, Budapest, 1991, Coll Math Soc J Bolyai.
7. F. R. K. Chung and R. L. Graham, On multicolor Ramsey numbers for complete bipartite graphs, J Combin Theory Ser B 18 (1975), 164-169.
8. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs - Theory and Application, Deutscher Verlag der Wissenschaften, Berlin, Academic Press, New York, 1980.
9. P. Erdös, A. Rényi and V. T. Sós, On a problem of graph theory, Studia Sci. Math Hungar 1 (1966), 215-235.
10. P. Erdós and M. Simonovits, Compactness results in extremal graph theory, Combinatorica 2 (3) (1982), 275-288.
11. P. Erdós, Some old and new problems in various branches of combinatorics, Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, 1979, Vol. 1,
12. Congressus Numerantium 23 (1979), 19-38.
13. P. Erdös and H. Sachs, Regular graphs of given girth and minimum order, Wiss Z Univ Halle Martin Luther Univ Halle - Wittenberg Math - Natur Reine 12 (1963), 251-257.
14. R. J. Faudree and M. Simonovits, On a class of degenerate extremal problems II, preprint.
15. R. J. Faudree and M. Simonovits, On a class of degenerate extremal graph problems, Combinatorica 3 1 (1983), 83-93.
16. Z. Füredi, Graphs without quadrilaterals, J Combin Theory Ser B 34 (1983), 187-190.
17. 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 (2) (1995), 228-239.
18. Z. Füredi, On the number of edges of quadrilateral-free graphs, J Combin Theory Ser B 68 (1) (1996), 1-6.
19. Z. Füredi, Quadrilateral-free graphs with maximum number of edges, preprint.
20. D. K. Garnick, and N. A. Nieuwejaar, Non-isomorphic extremal graphs without three-cycles and four-cycles, J Combin Math Combin Comput 12 (1992), 33-56.
21. N. Jacobson, Basic Algebra I, W. H. Freeman, San Francisco, 1974.
22. M. S. Jacobson, M. Truszczyński, and Z. Tuza, Decompositions of regular bipartite graphs, Discrete Math 89 (1991), 17-27.
23. F. Lazebnik and D. Mubayi, New lower bounds for Ramsey numbers of graphs and hypergraphs, preprint.
24. F. Lazebnik and V. A. Ustimenko, New examples of graphs without small cycles and of large size, Eur J Combinatorics 14 (1993), 445-460.
25. F. Lazebnik and V. A. Ustimenko, Explicit construction of graphs with an arbitrary large girth and of large size, Discrete Appl Math 60 (1995), 275-284.
26. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar, New constructions of bipartite graphs on m, n vertices with many edges and without small cycles, J Combin Theory, Ser B, 61 (1) (1994), 111-117.
27. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar, Properties of certain families of 2k-cycle free graphs, J Combin Theory, Ser B, 60 (2) (1994), 293-298.
28. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar, A new series of dense graphs of high girth, Bulletin of the AMS 32 (1) (1995), 73-79.
29. F. Lazebnik, V. A. Ustimenko, and A. J. Woldar, A characterization of the components of the graphs D(k, q), Discrete Math 157 (1996), 271-283.
30. F. Lazebnik, and V. A. Ustimenko, A. J. Woldar, New upper bounds on the order of cages, Electronic J Combin 14 R13 (1997), 1-11.
31. F. Lazebnik V. A. Ustimenko, and A. J. Woldar, Polarities and 2k-cycle-free graphs, Discrete Math 197/198 (1999), 503-513.
32. F. Lazebnik, and P. Wang, On the extremal graphs of high girth, J Graph Theory 26 (1997), 147-153.
33. F. Lazebnik, and A. J. Woldar, General properties of some families of algebraically defined graphs, Research Report, University of Delaware, 1999.
34. 4), J Combin Theory, Ser B, 79 (2000), 172-176.
35. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (3) (1988), 261-277.
36. G. A. Margulis, Explicit group-theoretical construction of combinatorial schemes and their application to design of expanders and concentrators, J Probl Inform Transmission, 24 (1988), 39-46
37. (translation from Problemy Peredachi Informatsii, 24 (1), (1988) 51-60.
38. S. P. Radziszowski, Small Ramsey numbers, Electronic J Combin. l DS1 (1994), 1-30.
39. H. Sachs, Regular graphs with given girth and restricted circuits, J London Math Society 38 (1963), 423-429.
40. N. Sauer, Extremal Properties I and II, Sitzungsberichte Österreich Acad Wiss Math Natur Kl., S-B II, 176 (1967), 9-25;
41. N. Sauer, Sitzungsberichte Österreich Acad Wiss Math Natur Kl., S-B II 176 (1967), 27-43.
42. A. J. Schwenk, Computing the characteristic polynomial of a graph, Graphs and Combinatorics, Proceedings and at George Washington Univ, 1973, Lecture Notes in Math 406, R. A. Bari and F. Harary, (Editors), Springer, Berlin, 1974.
43. M. Simonovits, Extremal Graph Theory, Selected Topics in Graph Theory 2, L. W. Beineke and R. J. Wilson (Editors), Academic Press, London, 1983, 161-200.
44. V. A. Ustimenko, On some properties of geometries of the Chevalley groups and their generalizations, in: Investigation in Algebraic Theory of Combinatorial Objects, I. A. Faradzev, A. A. Ivanov, M. H. Klin, and A. J. Woldar (Editors) Kluwer Acad. Publ, Dordrecht, (1991), 112-121.
45. V. A. Ustimenko, Coordinatiation of trees and their quotients, in Voronoj's Impaction Modern Science, Kiev Institute of Mathematics 1998, Vol. 2, 125-152.
46. V. A. Ustimenko, and A. J. Woldar, An improvement on the Erdös bound for graphs of girth 16, Contemporary Math Series of the Am Math Soc 184 (1995), 419-425.
47. H. Walther, Properties of regular graphs of given girth and minimum order, Wiss. Z. Ilmenau 11 (1965), 167-168.
48. H. Walther, On regular graphs of given girth and minimum order, Wiss Z Techn Hochsch Ilmenau 11 (1965), 93-96.
49. 10, s, J Combin Theory, Ser B 52, (1991), 113-116.
50. A. J. Woldar, Rainbow graphs, to appear in Procedings of OSU-Denison Conference: In honor of the 65th birthday of Dijen K. Ray-Chaudhuri.
51. A. J. Woldar and V. A. Ustimenko, An application of group theory to extremal graph theory, Group Theory, Proceedings of the Ohio State-Denison Conference, World Scientific, Singapore, 1993.