A construction of k-graceful graphs from complete bipartite graphs (Q1119954)
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 4099378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A construction of k-graceful graphs from complete bipartite graphs |
scientific article; zbMATH DE number 4099378 |
Statements
A construction of k-graceful graphs from complete bipartite graphs (English)
0 references
1988
0 references
For a special family of bipartite graphs M(m,n) built up of two copies of complete bipartite graphs \(K_{m,n}\) the problem of gracefulness is investigated and partial results are given.
0 references
graceful graphs
0 references
bipartite graphs
0 references
0.9143933
0 references
0 references
0.8932215
0 references
