|
Problemy Upravleniya, 2008, Issue 4, Pages 11–15
(Mi pu166)
|
|
|
|
Mathematical problems of control theory
On the spectrum of a ring-structured directed graph's adjacency matrix and its application
R. P. Agaev, S. V. Nikiforov, N. A. Andryushina Institute of Control Sciences, Russian Academy of Sciences
Abstract:
In the paper, it was investigated that if 2 arcs were removed from ring-structured directed graph with 2 Hamilton circuits, its spectrum would remain real if and only if the number of nodes were even, and the “distance between the arcs” removed from one cyclic path were maximal. The applicability of the results to fault-tolerance estimation of ring topology networks is examined.
Citation:
R. P. Agaev, S. V. Nikiforov, N. A. Andryushina, “On the spectrum of a ring-structured directed graph's adjacency matrix and its application”, Probl. Upr., 2008, no. 4, 11–15; Automation and Remote Control, 71:6 (2010), 1149–1157
Linking options:
https://www.mathnet.ru/eng/pu166 https://www.mathnet.ru/eng/pu/v4/p11
|
Statistics & downloads: |
Abstract page: | 184 | Full-text PDF : | 67 | References: | 29 |
|