Skip to main content
Log in

On digraphs with circulant adjacency matrices

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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

Access this article

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

Instant access to the full article PDF.

References

  1. A. Ádám, Research Problem 2–10. J. Combin. Theory2, 393 (1967).

    Google Scholar 

  2. B. Alspach, Point-Symmetric Graphs and Digraphs of Prime Order and Transitive Permutation Groups of Prime Degree. J. Combin. Theory Ser. B15, 12–17 (1973).

    Google Scholar 

  3. B. Alspach andT. D. Parsons, Isomorphisms of Circulant Graphs and Digraphs. Discrete Math.25, 97–108 (1979).

    Google Scholar 

  4. L. Babai, Isomorphism Problem for a Class of Point-Symmetric Structure. Acta. Math. Acad. Sci. Hungar29, 329–336 (1977).

    Google Scholar 

  5. J. L. Berggren, An Algebraic Characterization of Symmetric Graphs with a Prime Number of Vertices. Bull. Austral. Math. Soc.7, 131–134 (1972).

    Google Scholar 

  6. C. Y. Chao, On Groups and Graphs. Trans. Amer. Math. Soc.118, 488–497 (1965).

    Google Scholar 

  7. C. Y. Chao, On the Classification of Symmetric Graphs with a Prime Number of Vertices. Trans. Amer. Math. Soc.158, 247–256 (1971).

    Google Scholar 

  8. C. Y. Chao, Generalizations of Theorems of Wilson, Fermat and Euler. J.Number Theory15, 95–114 (1982).

    Google Scholar 

  9. C. Y. Chao, On Pólya-de Bruijn's Theorem. Congressus Numerantium60, 71–80 (1987).

    Google Scholar 

  10. C. Y. Chao andJ. G. Wells, A Class of Vertex-Transitive Digraphs. J.Combin. Theory14, 246–255 (1973).

    Google Scholar 

  11. C. Y. Chao andJ. G. Wells, A Class of Vertex-Transitive Digraph II. J.Combin. Theory32, 336–346 (1982).

    Google Scholar 

  12. P. J.Davis, Circulant Matrices. New York-Chichester-Brisbane-Toronto 1979.

  13. N. G.De Bruijn, Pólya's Theory of Counting. In: Applied Combinatorial Mathematics (E. F. Beckenbach, Ed.) Chapter 5, 144–184, New York-London-Sidney 1964.

  14. D. Z. Djokovic, Isomorphism Problem for a Special Class of Graphs. Acta Math. Acad. Sci. Hung.21, 267–270 (1970).

    Google Scholar 

  15. U.Dudley, Elementary Number Theory. San Francisco 1969.

  16. B. Elspas andJ. Turner, Graphs with Circulant Adjacency Matrices. J. Combin. Theory9, 297–307 (1970).

    Google Scholar 

  17. M.Hall, Jr., The Theory of Groups. New York 1959.

  18. F.Harary and E.Palmer, Graphical Enumeration. New York-London 1973.

  19. G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen and Chemische Verbindungen. Acta Math.68, 145–254 (1937).

    Google Scholar 

  20. S. Toida, A Note on Adam's Conjecture. J. Combin. Theory B23, 239–246 (1977).

    Google Scholar 

  21. J. Turner, Point-Symmetric Graphs with a Prime Number of Points. J.Combin.Theory3, 136–145 (1967).

    Google Scholar 

  22. B. L.van der Waerden, Modern Algebra. Vol. 1. New York 1953.

  23. H.Wielandt, Finite Permutation Groups. New York 1964.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chao, C.Y. On digraphs with circulant adjacency matrices. Arch. Math 54, 93–104 (1990). https://doi.org/10.1007/BF01190673

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation