On the connectivity of certain graphs of high girth

Felix Lazebnik, Raymond Viglione

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

Let q be a prime power and k ≥ 2 be an integer. Lazebnik et al. (Rutcor Research Report RRR 99-93, 1993; Bull. AMS 32 (1) (1995) 73) determined that the number of components of certain graphs D(k,q) introduced by Lazebnik and Ustimenko (Discrete Appl. Math. 60 (1995) 275) is at least qt-1 where t = ⌊(k + 2)/4⌋. This implied that these components (most often) provide the best-known asymptotic lower bound for the greatest number of edges in graphs of their order and girth. Lazebnik et al. (Discrete Math. 157 (1996) 271) showed that the number of components is (exactly) qt-1 for q odd, but the method used there failed for q even. In this paper we prove that the number of components of D(k,q) for even q > 4 is again q t-1 where t = ⌊(k+2)/4⌋. Our proof is independent of the parity of q as long as q > 4. Furthermore, we show that for q = 4 and k ≥ 4, the number of components is qt.

Original languageEnglish
Pages (from-to)309-319
Number of pages11
JournalDiscrete Mathematics
Volume277
Issue number1-3
DOIs
StatePublished - 28 Feb 2004

Keywords

  • Algebraic constructions
  • Connectivity
  • Dense graphs
  • High girth

Fingerprint

Dive into the research topics of 'On the connectivity of certain graphs of high girth'. Together they form a unique fingerprint.

Cite this