Skip to main content

Classes of Digraph Structures Corresponding to Characteristic Polynomials

  • Conference paper
  • First Online:
Challenges in Automation, Robotics and Measurement Techniques (ICA 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 440))

Included in the following conference series:

Abstract

This paper introduces the first classification of digraph structures corresponding to characteristic polynomials. It was found that digraph structures created can be divided into three classes with different feasibility for different polynomials—only structures of one class are found to be independent from wages of polynomial’s terms. In this paper classification of structures is described, along with method how to divide them and illustrated with examples.

Research has been financed with the funds of the Statutory Research of 2016.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)

    Book  Google Scholar 

  2. Blyth, T., Robertson, E.: Basic Linear Algebra, 2nd edn. Springer, London (2002)

    Book  MATH  Google Scholar 

  3. Fornasini, E., Valcher, M.E.: Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs. Linear Algebra Appl. 263, 275–310 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fornasini, E., Valcher, M.E.: On the positive reachability of 2D positive systems. LCNIS 297–304 (2003)

    Google Scholar 

  5. Hryniów, K., Markowski, K.A.: Parallel digraphs-building algorithm for polynomial realisations. In: Proceedings of 2014 15th International Carpathian Control Conference (ICCC), pp. 174–179 (2014). http://dx.doi.org/10.1109/CarpathianCC.2014.6843592

  6. Hryniów, K., Markowski, K.A.: Digraphs minimal realisations of state matrices for fractional positive systems. In: R. Szewczyk, C. Zieliński, M. Kaliczyńska (eds.) Progress in Automation, Robotics and Measuring Techniques, Advances in Intelligent Systems and Computing, vol. 350, pp. 63–72. Springer (2015). doi:10.1007/978-3-319-15796-2_7. http://dx.doi.org/10.1007/978-3-319-15796-2_7

    Google Scholar 

  7. Hryniów, K., Markowski, K.A.: Parallel multi-dimensional digraphs-building algorithm for finding a complete set of positive characteristic polynomial realisations of dynamic system. Appl. Math. Comput. (Submitted to)

    Google Scholar 

  8. Kaczorek, T.: Polynomial and Rational Matrices. Springer, London (2007)

    Book  MATH  Google Scholar 

  9. Wallis, W.D.: A Beginner’s Guide to Graph Theory. Biiokhäuser (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krzysztof Hryniów .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Hryniów, K., Markowski, K.A. (2016). Classes of Digraph Structures Corresponding to Characteristic Polynomials. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds) Challenges in Automation, Robotics and Measurement Techniques. ICA 2016. Advances in Intelligent Systems and Computing, vol 440. Springer, Cham. https://doi.org/10.1007/978-3-319-29357-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29357-8_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29356-1

  • Online ISBN: 978-3-319-29357-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics