## 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.
✦ LIBER ✦
Skew-adjacency matrices of graphs
✍ Scribed by M. Cavers; S.M. Cioabă; S. Fallat; D.A. Gregory; W.H. Haemers; S.J. Kirkland; J.J. McDonald; M. Tsatsomeros
- Book ID
- 113772252
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 525 KB
- Volume
- 436
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Graphs with nilpotent adjacency matrices
✍
Martin W. Liebeck
📂
Article
📅
1982
🏛
John Wiley and Sons
🌐
English
⚖ 149 KB
Invariant adjacency matrices of configur
✍
M. Abreu; M.J. Funk; D. Labbate; V. Napolitano
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 396 KB
Adjacency matrices and chemical transfor
✍
L. A. Gribov; V. A. Dementiev; I. V. Mikhailov
📂
Article
📅
2008
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 91 KB
Commutativity of the adjacency matrices
✍
S. Akbari; F. Moazami; A. Mohammadian
📂
Article
📅
2009
🏛
Elsevier Science
🌐
English
⚖ 466 KB
Bipartite graphs obtained from adjacency
✍
K.B. Reid
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 630 KB
If G denotes a graph of order n, then the adjacency matf;ix of an orientation G of G can be thought of as the adjacency matrix of a bipartite graph B(G) of order 2n, where the rows and columns correspond to the bipartition of B(G). For agraph H, let k(H) denote the number of connected components of
Unboundedness of Adjacency Matrices of L
✍
Sylvain Golénia
📂
Article
📅
2010
🏛
Springer
🌐
English
⚖ 187 KB