Which Digraphs with Ring Structure are Essentially Cyclic?

@article{Agaev2009WhichDW,
  title={Which Digraphs with Ring Structure are Essentially Cyclic?},
  author={Rafig P. Agaev and Pavel Yu. Chebotarev},
  journal={CoRR},
  year={2009},
  volume={abs/0910.3113}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Agaev, Coordination in multiagent systems and Laplacian spectra of digraphs, Autom

  • R.P.P.Yu. Chebotarev
  • Remote Control
  • 2009
1 Excerpt

The matrixforest theorem and measuring relations in small social groups , Autom

  • E. V. Shamis P. Yu. Chebotarev
  • Remote Control
  • 2009

Laplacian matrices and essentially cyclic weighted digraphs

  • P. Chebotarev
  • Abstracts of the 13th Conference of the…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…