A characterisation of weak integer additive set-indexers of graphs (Q2961276)
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: A characterisation of weak integer additive set-indexers of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterisation of weak integer additive set-indexers of graphs |
scientific article |
Statements
20 February 2017
0 references
integer additive set-indexers
0 references
weakly uniform integer additive set-indexers
0 references
weak integer additive set-indexers
0 references
mono-indexed elements of a graph
0 references
sparing number of a graph
0 references
A Characterisation of weak integer additive Set-Indexers of graphs (English)
0 references
0.9168126583099364
0 references
0.8974663615226746
0 references
0.8444971442222595
0 references
0.8418313264846802
0 references
0.8345114588737488
0 references
