Abstract
A design graph is a regular bipartite graph in which any two distinct vertices of the same part have the same number of common neighbors. This class of graphs has a close relationship to strongly regular graphs. In this paper, we study the distance eigenvalues of the design graphs. Also, we will explicitly determine the distance eigenvalues of a class of design graphs, and determine the values for which the class is distance integral, that is, its distance eigenvalues are integers.
Similar content being viewed by others
References
Aouchiche, M., Hansen, P.: Distance spectra of graphs: a survey. Linear Algebra Appl. 458, 301–386 (2014)
Atik, F., Panigrahi, P.: On the distance spectrum of distance regular graphs. Linear Algebra Its Appl. 478, 256–273 (2015)
Baliáska, K., Cvetković, D., Radosavljević, Z., Simić, S., Stevanović, D.: A survey on integral graphs. Publ. Elektroteh. Fak. Univ. Beogr. Ser. Mat. 13, 42–65 (2002)
Bapat, R.B.: Graphs and Matrices, 2nd edn. Springer, New York (2014)
Bapat, R.B., Jana, R., Pati, S.: The bipartite distance matrix of a nonsingular tree. Linear Algebra Its Appl. 631, 254–281 (2021)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1989)
Brualdi, R.A.: Introductory Combinatorics, 5th edn. Chapman and Hall, CRC Press, Boca Raton (2009)
Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, New York (2001)
Harary, F., Schwenk, A.J.: Which graphs have integral spectra? In: Bari, R., Harary, F. (eds.) Graphs and Combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973). Lecture Notes in Mathematics, vol. 406, pp. 45–51. Springer, Berlin (1974)
Lin, H., Shu, J., Xue, J., Zhang, Y.: A survey on distance spectra of graphs. Adv. Math. (China) 50(1), 29–76 (2021)
Lu, L., Huang, Q.: Distance eigenvalues of \(B (n, k)\). Linear Multilinear Algebra 69(11), 2078–2092 (2021). https://doi.org/10.1080/03081087.2019.1659221
Mirafzal, S.M.: A new class of integral graphs constructed from the hypercube. Linear Algebra Appl. 558, 186–194 (2018)
Mirafzal, S.M., Ziaee, M.: Some algebraic aspects of enhanced Johnson graphs. Acta Math. Univ. Comen. 88(2), 257–66 (2019)
Mirafzal, S.M., Zafari, A.: Some algebraic properties of bipartite Kneser graphs. Ars Comb. 153, 3–14 (2020)
Mirafzal, S.M.: The automorphism group of the bipartite Kneser graph. Proc. Math. Sci. (2019). https://doi.org/10.1007/s12044-019-0477-9
Mirafzal, S.M.: Cayley properties of the line graphs induced by consecutive layers of the hypercube. Bull Malays. Math. Sci. Soc. 1, 1 (2020). https://doi.org/10.1007/s40840-020-01009-3
Mirafzal, S.M.: On the automorphism groups of connected bipartite irreducible graphs. Proc. Math. Sci. (2020). https://doi.org/10.1007/s12044-020-0589-1
Mirafzal, S.M.: The line graph of the crown graph is distance integral. Linear Multilinear Algebra (2022). https://doi.org/10.1080/03081087.2022.2040941
Mirafzal, S.M.: Some remarks on the square graph of the hypercube. Ars Math. Contemp. 23(2) (2023)
Mirafzal, S.M., Kogani, R.: On determining the distance spectrum of a class of distance integral graphs. J. Algebr. Syst. 10(2), 299–308 (2023)
Mirafzal, S.M.: Some new classes of distance integral graphs constructed from integral graphs. J. Linear Topol. Algebra 12(01), 43–47 (2023)
Nica, B.: A Brief Introduction to Spectral Graph Theory. EMS Publishing House, Zuerich (2018)
Pokorný, M., Híc, P., Stevanović, D., Milos̆ević, M.: On distance integral graphs. Discrete Math. 338, 1784–1792 (2015)
Stephen, W.: Wolfram Mathematica 8
Wu, Y., Zhang, X., Feng, L., Wu, T.: Distance and adjacency spectra and eigenspaces for three (di) graph lifts: a unified approach. Linear Algebra Its Appl. 672, 147–181 (2023)
Acknowledgements
The author is thankful to the anonymous reviewers for their valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Mirafzal, S.M. On the distance eigenvalues of design graphs. Ricerche mat 73, 2759–2769 (2024). https://doi.org/10.1007/s11587-023-00794-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11587-023-00794-w