Radius \(r\) extremal graphs of girth 5
From MaRDI portal
Publication:6562417
zbMATH Open1542.05086MaRDI QIDQ6562417
Publication date: 26 June 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- New families of graphs without short cycles and large size
- The NIP graph of a social welfare function
- Local majorities, coalitions and monopolies in graphs: A review
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Constraints for symmetry breaking in graph representation
- Practical graph isomorphism. II.
- Fast generation of regular graphs and construction of cages
- Extremal graphs without three‐cycles or four‐cycles
- On the structure of extremal graphs of high girth
- On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
This page was built for publication: Radius \(r\) extremal graphs of girth 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562417)
