Counting short cycles of (c,d)-regular bipartite graphs

DOI10.1142/S1793830921500221zbMath1475.05089arXiv1808.00352OpenAlexW3094320352MaRDI QIDQ5013469

Mohsen Alinejad, Kazem Khashyarmanesh

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.00352

zbMATH Keywords

bipartite graphclosed walks(c, d)-regular graphscycle-free walks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• An algorithm for counting short cycles in bipartite graphs
• Regular and irregular progressive edge-growth tanner graphs
• A recursive approach to low complexity codes
• Design of capacity-approaching irregular low-density parity-check codes
• The Parameterized Complexity of Counting Problems
• On Short Cycle Enumeration in Biregular Bipartite Graphs
• On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
• Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
• On the Girth of Quasi-Cyclic Protograph LDPC Codes
• On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles