𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Graphs with the n-e.c. adjacency propert
✍ Catharine A. Baker; Anthony Bonato; Neil A. McKay; PaweΕ‚ PraΕ‚at πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

## 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.

Factorization for efficient solution of
✍ A. Kaveh; H. Rahami πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 483 KB

## 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 calculation of transfer matrices of
✍ IstvΓ‘n VΓ‘gΓ³ πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 330 KB

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.