Girth (graph theory)

Known as: Girth, Girth of a graph, Odd girth 
In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (i.e. it's… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this correspondence, we present a method for constructing sparse matrices that have a compact description and whose associated… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We investigate the importance of space when solving problems based on graph distance in the streaming model. In this model, the… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We propose a general method for constructing Tanner graphs with large girth by progressively establishing edges or connections… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Let k ≥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a q–regular… (More)
  • table 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Let k ≥ 1 be an odd integer, t = ⌊ 4 ⌋ , and q be a prime power. We construct a bipartite, q-regular, edge-transitive graph CD(k… (More)
Is this relevant?
1983
1983
It is shown that a graph of large girth and minimum degree at least 3 share many properties with a graph of large minimum degree… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
All graph-theoretic concepts, which are not defined further, are taken from [6, 111. By graphs we mean nondirected graphs without… (More)
Is this relevant?