Counting short cycles of \((c,d)\)-regular bipartite graphs (Q5013469)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7435892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting short cycles of \((c,d)\)-regular bipartite graphs |
scientific article; zbMATH DE number 7435892 |
Statements
Counting short cycles of (c,d)-regular bipartite graphs (English)
0 references
30 November 2021
0 references
(c, d)-regular graphs
0 references
bipartite graph
0 references
closed walks
0 references
cycle-free walks
0 references
0.859843909740448
0 references
0.8529930114746094
0 references
0.7715965509414673
0 references
0.7387915849685669
0 references
0.7255269289016724
0 references
