Relation of the edge sets between the competition graph and the \((1,2)\)-step competition graph of a bipartite tournament (Q3131799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relation of the edge sets between the competition graph and the (1,2)-step competition graph of a bipartite tournament |
scientific article; zbMATH DE number 6831308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relation of the edge sets between the competition graph and the \((1,2)\)-step competition graph of a bipartite tournament |
scientific article; zbMATH DE number 6831308 |
Statements
29 January 2018
0 references
bipartite tournament
0 references
competition graph
0 references
\((1,2)\)-step competition graph
0 references
0.8801920413970947
0 references
0.8240668177604675
0 references
0.8132374882698059
0 references
0.8098383545875549
0 references
0.7828119993209839
0 references
