Skip to main content
SpringerLink
Log in

Free gerbiers and nets

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

The powers of the adjacency matrix over the integers of a net or diagraph determine the number of walks of a given length between two vertices. If the ring of integers is replaced by suitable algebraic structures, a great deal more may be determined. In this paper such structures are given for which the individual paths and walks may be determined.

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. M. A. Arbib,Theories of Abstract Automata, Prentice Hall, Englewood Cliffs, N.J., 1969.

    Google Scholar 

  2. P. L. Hammer andS. Rudeanu,Boolean Methods In Operations Research, Springer-Verlag, Heidelberg, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia State University, USA

    Jean H. Bevis

Authors
  1. Jean H. Bevis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bevis, J.H. Free gerbiers and nets. Math. Systems Theory 8, 127–131 (1974). https://doi.org/10.1007/BF01762182

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762182

Keywords

Search

Navigation