Constructing status injective graphs (Q1377622)
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 1109904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing status injective graphs |
scientific article; zbMATH DE number 1109904 |
Statements
Constructing status injective graphs (English)
0 references
8 April 1998
0 references
A graph is status injective if all its vertices have different status (sum of distances to all other vertices). Infinite families of graphs are constructed with consecutive integers as stati. Any given graph is an induced subgraph of any number of nonisomorphic status injective graphs. Thus the status sequence is a valuable distance-related invariant, but it also is highly degenerate.
0 references
distance-sum
0 references
status sequence
0 references
Wiener index
0 references
0.8468006253242493
0 references
0.8452166318893433
0 references
0.828876793384552
0 references
0.825389564037323
0 references
0.7787598371505737
0 references
