Skip to main content
SpringerLink
Log in

Ring structure digraphs: Spectrum of adjacency matrix and application

  • Control Sciences
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Under elimination of two arcs, spectrum of digraph having ring structure and two Hamiltonian cycles is shown real, if and only if the number of vertices is even and “interval between arcs,” eliminated from the same cycle, is maximal. Possibility to apply the obtained results to evaluate failure-resistance of networks with ring topology is considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Vukadinovic, D., Huang, P., and Erlebach, Th., On the Spectrum and Structure of Internet Topology Graphs, in II Int. Workshop on Innovative Internet Computing Systems (IICS), Lecture Notes in Computer Science, Berhn: Springer, 2002, vol. 2346, pp. 83–95.

    Google Scholar 

  2. Agaev, R.P. and Chebotarev, P.Yu., Laplace Spectra of Digraphs and Their Applications, Autom. Remote Control, 2005, no. 5, pp. 719–733.

    Article  MathSciNet  Google Scholar 

  3. Biggs, N., Algebraic Graph Theory, Cambridge: Cambridge Univ. Press, 1993.

    Google Scholar 

  4. Cvetkovic, D., Doob, M., and Sachs, H., Spectra of Graphs — itTheory and Application, New York: Academic, 1980. Translated under the title Spektry grafov: teoriya i primenenie, Kiev: Naukova Dumka, 1984.

    Google Scholar 

  5. Agaev, R.P., Investigation and Application of Laplace Spectra of Digraphs with the Ring Structure, Autom. Remote Control, 2008, no. 2, pp. 177–188.

    MathSciNet  Google Scholar 

  6. Olifer, V.G. and Olifer, N.A., Komp’yuternye seti (Computer Networks), St. Petersburg: Piter, 2006.

    Google Scholar 

  7. Boesch, F.T. and Prodinger, H., Spanning Tree Formulas and Chebyshev Polynomials, Graphs and Combinatorics, 1986, vol. 2, pp. 191–200.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhang, Y., Yong, X., and Golin, M., The Number of Spanning Trees in Circulant Graphs, Discrete Math., 2000, vol. 223, pp. 337–350.

    Article  MATH  MathSciNet  Google Scholar 

  9. Zhang, Y., Yong, X., and Golin, M., Chebyshev Polynomials and Spanning Tree Formulas for Circulant and Related Graphs, Discrete Math., 2005, vol. 298, pp. 334–364.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    R. P. Agaev, S. V. Nikiforov & N. A. Andryushina

Authors
  1. R. P. Agaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Nikiforov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. A. Andryushina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © R.P. Agaev, S.V. Nikiforov, and N.A. Andryushina, 2008, published in Problemy Upravleniya, 2008, No. 4, PP. 11–15.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agaev, R.P., Nikiforov, S.V. & Andryushina, N.A. Ring structure digraphs: Spectrum of adjacency matrix and application. Autom Remote Control 71, 1149–1157 (2010). https://doi.org/10.1134/S0005117910060160

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117910060160

Keywords

Search

Navigation