The balanced labeling of the unconnected graph \(C_8(r_1,0,r_2,0,\dots, 0)\cup G\) (Q2924722)
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: The balanced labeling of the unconnected graph C₈(r₁,0,r₂,0,, 0) G |
scientific article; zbMATH DE number 6365094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The balanced labeling of the unconnected graph \(C_8(r_1,0,r_2,0,\dots, 0)\cup G\) |
scientific article; zbMATH DE number 6365094 |
Statements
3 November 2014
0 references
graceful graph
0 references
unconnected graph
0 references
balanced bipartite graph
0 references
0.89471936
0 references
0.8918503
0 references
0.8610152
0 references
0.8556243
0 references
0.85056394
0 references
The balanced labeling of the unconnected graph \(C_8(r_1,0,r_2,0,\dots, 0)\cup G\) (English)
0 references
