8422

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Which Digraphs With Ring Structure Are Essentially Cyclic?

ISBN/ISSN: 

0196-8858

Наименование источника: 

  • Advances in Applied Mathematics

Обозначение и номер тома: 

V. 45. No. 2

Город: 

  • Amsterdam

Издательство: 

  • Elsevier

Год издания: 

2010

Страницы: 

232–251
Аннотация
Abstract. We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of graph topology is difficult and yet unsolved. Its solution is important for some applications of graph theory, including that in decentralized control. In the present paper, this problem is solved with respect to the class of digraphs with ring structure, which models some typical communication networks. It is shown

Библиографическая ссылка: 

Агаев Р.П., Чеботарев П.Ю. Which Digraphs With Ring Structure Are Essentially Cyclic? // Advances in Applied Mathematics. 2010. V. 45. No. 2. С. 232–251.