The gracefulness of unconnected graphs \((P_3\vee \overline{K_m}) \cup G\) and \((C_3 \vee \overline{K_m}) \cup G\) (Q4926968)
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 gracefulness of unconnected graphs (Pā K_m) G and (Cā K_m) G |
scientific article; zbMATH DE number 6179182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The gracefulness of unconnected graphs \((P_3\vee \overline{K_m}) \cup G\) and \((C_3 \vee \overline{K_m}) \cup G\) |
scientific article; zbMATH DE number 6179182 |
Statements
20 June 2013
0 references
disconnected graph
0 references
graceful graphs
0 references
graceful labeling
0 references
0.9311171174049376
0 references
0.9284634590148926
0 references
0.9205203652381896
0 references
