An Eigenvalue Characterization of Antipodal Distance Regular Graphs

@article{Fiol1997AnEC,
  title={An Eigenvalue Characterization of Antipodal Distance Regular Graphs},
  author={Miguel Angel Fiol},
  journal={Electr. J. Comb.},
  year={1997},
  volume={4}
}
Let Γ be a regular (connected) graph with n vertices and d + 1 distinct eigenvalues. As a main result, it is shown that Γ is an r-antipodal distanceregular graph if and only if the distance graph Γd is constituted by disjoint copies of the complete graph Kr, with r satisfying an expression in terms of n and the distinct eigenvalues. AMS subject classifications. 05C50 05E30 

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Distance-regularity and the spectrum of graphs

  • W. H. Haemers
  • Linear Algebra Appl
  • 1996
Highly Influential
7 Excerpts

A characterization of distance-regular graphs with diameter three

  • E. R. van Dam, W. H. Haemers
  • J. Algebraic Combin
  • 1977
Highly Influential
7 Excerpts

Contribució a la Teoria Espectral de Grafs: Problemes Mètrics i Distancia-Regularitat

  • E. Garriga
  • Ph.D. Thesis, Universitat Politècnica de…
  • 1997
1 Excerpt

Distance-Regular Graphs. Springer-Verlag, Berlin, 1989. the electronic journal of combinatorics

  • A. E. Brouwer, A. M. Cohen, A. Neumaier
  • 1997
1 Excerpt

Graphs with Few Eigenvalues

  • E. R. van Dam
  • Ph.D. Thesis, Tilburg University,
  • 1996
1 Excerpt

Locally pseudo - distance - regular graphs

  • E. Garriga M. A. Fiol
  • J . Combin . Theory Ser . B
  • 1996

Similar Papers

Loading similar papers…