Skip to main content
Log in

Adjacency matrices of polarity graphs and of other C 4-free graphs of large size

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we give a method for obtaining the adjacency matrix of a simple polarity graph G q from a projective plane PG(2, q), where q is a prime power. Denote by ex(n; C 4) the maximum number of edges of a graph on n vertices and free of squares C 4. We use the constructed graphs G q to obtain lower bounds on the extremal function ex(n; C 4), for some n < q 2 + q + 1. In particular, we construct a C 4-free graph on \({n=q^2 -\sqrt{q}}\) vertices and \({\frac{1}{2} q(q^2-1)-\frac{1}{2}\sqrt{q} (q-1) }\) edges, for a square prime power q.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baer R. (1946) Polarities in finite projective planes. Bull. Amer. Math. Soc. 52: 77–93

    Article  MATH  MathSciNet  Google Scholar 

  2. Balbuena C. (2008) Incidence matrices of projective planes and other bipartite graphs of few vertices. Siam J. Discret. Maths. 22(4): 1351–1363

    Article  MATH  MathSciNet  Google Scholar 

  3. Bondy J.A., Murty U.S.R.: Graph theory. In: Graduate Texts in Mathematics, vol. 244. Springer, New York (2008).

  4. Bondy J.A., Erdős P., Fajtlowicz S. (1999) Graphs of diametre two with no 4–circuits. Discrete Math. 200: 21–25

    Article  MATH  MathSciNet  Google Scholar 

  5. Brown W.G. (1966) On graphs that do not contain a Thomsen graph. Canad. Math. Bull. 9: 281–285

    MATH  MathSciNet  Google Scholar 

  6. Chartrand G., Lesniak L. (1996) Graphs and digraphs, 3rd edn. Chapman and Hall, London

    MATH  Google Scholar 

  7. Clapham C.R.J., Flockhart A., Sheehan J. (1989) Graphs without four-cycles. J. Graph Theory 13: 29–47

    Article  MATH  MathSciNet  Google Scholar 

  8. Erdős P., Rényi A., Sós V.T. (1966) On a problem of graph theory. Studia Sci. Math. Hungar. 1: 51–57

    MathSciNet  Google Scholar 

  9. Exoo G., Jajcay R.: Dynamic Cage Survey. Electron. J. Combin. 15, #DS16 (2008).

    Google Scholar 

  10. Füredi Z. (1983) Graphs without quadrilaterals. J. Combin. Theory Ser. B 34: 187–190

    Article  MATH  MathSciNet  Google Scholar 

  11. Füredi Z. (1996) On the number of edges of quadrilateral-free graphs. J. Combin. Theory Ser. B 68: 1–6

    Article  MATH  MathSciNet  Google Scholar 

  12. Hughes D.R., Piper F.C.: Projective planes In: Graduate Texts in Mathematics, vol. 6. Springer-Verlag, New York-Berlin (1973).

  13. Kantor W.M. (1977) Moore geometries and rank 3 groups having μ = 1. Quart. J. Math. Oxford 28(2): 309–328

    Article  MATH  MathSciNet  Google Scholar 

  14. Lang S.: Algebra, GTM, vol. 211, revised 3rd edn. Springer, New York (2002).

  15. Wong P.K. (1982) Cages-a survey. J. Graph Theory 6: 1–22

    Article  MATH  MathSciNet  Google Scholar 

  16. Yang Y., Rowlinson P. (1992) On extremal graphs without four-cycles. Utilitas Math. 41: 204–220

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Labbate.

Additional information

Communicated by Ron Mullin, Rainer Steinwandt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abreu, M., Balbuena, C. & Labbate, D. Adjacency matrices of polarity graphs and of other C 4-free graphs of large size. Des. Codes Cryptogr. 55, 221–233 (2010). https://doi.org/10.1007/s10623-010-9364-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-010-9364-1

Keywords

Mathematics Subject Classification (2000)

Navigation