scientific article; zbMATH DE number 4010561
From MaRDI portal
Publication:3760580
[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.
Recommendations
Cited in
(6)- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Enumerating characteristics of a kind of chain-like graphs
- scientific article; zbMATH DE number 4029616 (Why is no real title available?)
- Vector weighted Stirling numbers and an application in graph theory
- Stirling numbers of the first kind for graphs
- Stirling decomposition of graph homology in genus 1
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760580)