Minimum fundamental cycle basis of \((n-2)\)-regular bipartite graphs with order \(2n\) (Q2823764)
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 6634504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum fundamental cycle basis of \((n-2)\)-regular bipartite graphs with order \(2n\) |
scientific article; zbMATH DE number 6634504 |
Statements
6 October 2016
0 references
regular bipartite graph
0 references
cycle basis of graph
0 references
minimum cycle basis
0 references
Minimum fundamental cycle basis of \((n-2)\)-regular bipartite graphs with order \(2n\) (English)
0 references
0.9116689562797546
0 references
0.7958760857582092
0 references
0.7659284472465515
0 references
0.7633034586906433
0 references
0.7586523294448853
0 references
