## Abstract Only recently have techniques been introduced that apply design theory to construct graphs with the __n__βe.c. adjacency property. We supply a new random construction for generating infinite families of finite regular __n__βe.c. graphs derived from certain resolvable Steiner 2βdesigns.
Graphs with nilpotent adjacency matrices
β Scribed by Martin W. Liebeck
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 149 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Given any integer t β₯ 2 and any prime number p, a graph Ξ~p,t~ is constructed whose adjacency matrix is nilpotent of index t over Z~p'~ the field of p elements.
π SIMILAR VOLUMES
## Abstract Many structural models can be generated as the graph products of two or three subgraphs known as their generators. The main types of graph products consist of Cartesian, strong Cartesian, direct, and lexicographic products. In this paper, a general method is presented for the factorizat
The paper presents a method based on the concept of signal flow graphs which is suitable for the determination of transfer matrices of linear systems excited by continuous or by continuous and sampled-data signals. The method is valid in case of several excitations and responses.