Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
Alexandru BalabanAndrás HajnalBiregular graphBull graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Mitigation of linear and nonlinear impairments in high-speed optical networks by using LDPC-coded turbo equalization
We study a turbo equalization scheme based on low-density parity-check (LDPC) coded turbo equalization (TE). This scheme is… 
2008
2008
Total Domination in Graphs with Given Girth
A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to… 
Highly Cited
2005
Highly Cited
2005
Construction of low-density parity-check codes by superposition
This paper presents a superposition method for constructing low-density parity-check (LDPC) codes. Several classes of structured… 
Highly Cited
2005
Highly Cited
2005
Growth response of Ricinus communis L (castor oil) in spent lubricating oil polluted soil
The growth response of castor oil plant, Ricinus communis , in spent lubricating oil (SLO) was investigated using 1-6% w/w SLO… 
Highly Cited
2004
Highly Cited
2004
Block-circulant low-density parity-check codes for optical communication systems
A novel family of structured low-density parity-check (LDPC) codes with block-circulant parity-check matrices that consist of… 
Highly Cited
2004
Highly Cited
2004
Size class distribution and spatial pattern of Vitellaria paradoxa in relation to farmers' practices in Mali
The impact of human activities on size class distribution and spatial distribution of Vitellaria paradoxa (karité or shea butter… 
2004
2004
Community structure and species diversity of Saddle Peak forests in Andaman Island
Saddle Peak forests, declared as a National Park, in Diglipur forest division of north Andaman (13°15' to 13° 41' N and 92° 37… 
Highly Cited
2001
Highly Cited
2001
Designing LDPC codes using bit-filling
Bipartite graphs of bit nodes and parity check nodes arise as Tanner graphs corresponding to low density parity check codes… 
Highly Cited
2001
Highly Cited
2001
Extended bit-filling and LDPC code design
Campello, Modha and Rajagopalan (see Proc. Int. Conf. Communications (ICC), Helsinki, Finland, 2001) proposed a simple-to… 
Highly Cited
1995
Highly Cited
1995
Is carbon nitride harder than diamond? No, but its girth increases when stretched (negative Poisson ratio)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)