Distant total irregularity strength of graphs via random vertex ordering (Q1699557)
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 6842970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distant total irregularity strength of graphs via random vertex ordering |
scientific article; zbMATH DE number 6842970 |
Statements
Distant total irregularity strength of graphs via random vertex ordering (English)
0 references
23 February 2018
0 references
total vertex irregularity strength of a graph
0 references
1-2 conjecture
0 references
\(r\)-distant total irregularity strength of a graph
0 references
0 references
0 references
0.9367084
0 references
0.92456126
0 references
0.92302275
0 references
0.91497445
0 references
0.9149341
0 references
0.91374874
0 references
0.9124421
0 references
0.91035604
0 references
0 references
0 references
