𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rank of adjacency matrices of directed (strongly) regular graphs

✍ Scribed by L.K. Jørgensen

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
203 KB
Volume
407
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Bipartite graphs obtained from adjacency
Bipartite graphs obtained from adjacency matrices of orientations of graphs
✍ 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

New families of strongly regular graphs
New families of strongly regular graphs
✍ Yury J. Ionin; Hadi Kharaghani 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil

Second neighbourhoods of strongly regula
Second neighbourhoods of strongly regular graphs
✍ A.D. Gardiner; C.D. Godsil; A.D. Hensel; Gordon F. Royle 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 723 KB

## Some antipodal distance-regular graphs of diameter three arise as the graph induced by the vertices at distance two from a given vertex in a strongly regular graph. We show that if every vertex in a strongly regular graph G has this property, then G is the noncollinearity graph of a special typ