Skip to main content
SpringerLink
Log in

Hadamard graphs. II

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The automorphism groups of Hadamard graphs are determined, and some particular properties of the Hadamard graph of size 8 are shown.

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. Hoffman, A.J.: Eigenvalues of graphs. MAA Stud. Math.12, 225–245 (1975)

    Google Scholar 

  2. Ito, N.: On a family of conjugacy classes graph. Mem. Konan Univ.31, 105–112 (1984)

    MATH  Google Scholar 

  3. Ito, N.: Hadamard Graphs. I. Graphs and Combinatorics1, 57–64 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ito, N., Leon, J.: An Hadamard matrix of order 36. J. Comb. Theory (A)34, 244–247 (1983)

    Article  MathSciNet  Google Scholar 

  5. Leon, J.: An algorithm for computing the automorphism group of a Hadamard matrix. JCTA27, 289–306 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Verheiden, E.: Integral and rational completions of combinatorial matrices. JCTA25, 267–276 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Konan University, 658, Kobe, Japan

    Noboru Ito

Authors
  1. Noboru Ito
    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

Ito, N. Hadamard graphs. II. Graphs and Combinatorics 1, 331–337 (1985). https://doi.org/10.1007/BF02582961

Download citation

  • Issue Date:

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

Keywords

Search

Navigation