No label defined (Q3760580)
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 4010561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4010561 |
Statements
1986
0 references
Stirling numbers
0 references
adjacency matrix
0 references
Stirling graph
0 references
Connectivity properties
0 references
networks
0 references
0.8535475730895996
0 references
0.841495156288147
0 references
0.7705830335617065
0 references
0.7293276190757751
0 references
0.7234864234924316
0 references
[For the entire collection see Zbl 0608.00004.] Stirling numbers of the first kind of orders up to n, reduced modulo 2, determine the adjacency matrix of a graph on n vertices, called by the authors a Stirling graph of order n. Connectivity properties of these graphs are studied from the point of view of their potential for interconnection networks in multiprocessing systems.
0 references