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.
2011
2011
Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields
A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based… 
2010
2010
Phytoremediation potential of kenaf (Hibiscus cannabinus L.) grown in different soil textures and cadmium concentrations.
This study investigated effect of soil textures and cadmium (Cd) concentrations on the growth, fibre yields and Cd absorption of… 
2009
2009
UGENT GUIDELINES FOR CURVED WIDE PLATE TESTING
This paper provides the UGent guidelines for the design, testing and evaluation of tensile loaded CWP specimens for the… 
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… 
2007
2007
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Given a graph G and an integer k ≥ 0, the NP-complete INDUCED MATCHING problem asks for an edge subset M such that M is a… 
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… 
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)
1982
1982
Eigenvalue multiplicities of highly symmetric graphs
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)