An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154)
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: An improved upper bound for the neighbor sum distinguishing index of graphs |
scientific article; zbMATH DE number 6334407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound for the neighbor sum distinguishing index of graphs |
scientific article; zbMATH DE number 6334407 |
Statements
An improved upper bound for the neighbor sum distinguishing index of graphs (English)
0 references
26 August 2014
0 references
neighbor distinguishing index
0 references
neighbor sum distinguishing index
0 references
0 references
0 references
0.917120397090912
0 references
0.8954195380210876
0 references
0.8909931778907776
0 references
0.8864088654518127
0 references
