Abstract
A graph G is called integral if all zeros of its characteristic polynomial P(G, x) are integers. In this paper, the bipartite graphs K p, q(t), K p(s), q(t) and K p, q ≡ K q, r are defined. We shall derive their characteristic polynomials from matrix theory. We also obtain their sufficient and necessary conditions for the three classes of graphs to be integral. These results generalize some results of Balińska et al. The discovery of these integral graphs is a new contribution to the search of integral graphs.
Supported by NSFC (No.70571065) and DPOP in NPU.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balińska, K.T., Cvetković, D., Radosavljević, Z., Simić, S.K., Stevanović, D.: A Survey on Integral Graphs. Univ. Beograd, Publ. Elektrotehn. Fak. Ser. Mat. 13, 42–65 (2002)
Balińska, K.T., Kupczyk, M., Simić, S.K., Zwierzýnski, K.T.: On Generating all Integral Graphs on 11 Vertices. Tech. Rep. 469, Computer Science Center, Techn. Univ. of Poznán (1999/2000)
Balińska, K.T., Simić, S.K.: The Nonregular, Bipartite, Integral Graphs with Maximum Degree 4. Part I: Basic Properties. Discrete Math. 236(1-3), 13–24 (2001)
Balińska, K.T, Simić, S.K, Zwierzyński, K.T.: Which Non-Regular Bipartite Integral Graphs with Maximum Degree Four Do not Have ±1 as Eigenvalues?. Discrete Math. 286(1-2), 15–24 (2004)
Bussemaker, F.C., Cvetković, D.: There are Exactly 13 Connected Cubic Integral Graphs. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 544, 43–48 (1976)
Cao, Z.F.: On the Integral Trees of Diameter R when 3 ≤ R ≤ 6. J. Heilongjiang University 2(1-3), 95 (1988)
Cao, Z.F.: Some New Classes of Integral Trees with Diameter 5 or 6. J. Systems Sci. Math. Sci. 11(1), 20–26 (1991)
Cao, Z.F.: Introductory Diophantine Equations. Haerbin: Haerbin Polytechnical University Press (1989)
Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs—Theory and Application. Academic Press, New York, Francisco. London (1980)
Cvetković, D., Simić, S.K., Stevanović, D.: 4-Regular Integral Graphs. Univ. Beograde. Publ. Elektrotehn. Fak. Ser. Mat. 9, 89–102 (1998)
Hansen, P., Mélot, H.: Computers and Discovery in Algebraic Graph Theory. Linear Algebra Appl. 356, 211–230 (2002)
Harary, F., Schwenk, A.J.: Which Graphs Have Integral Spectra?. In: Bari, R., Harary, F. (eds.) Graphs and Combinatorics. Lecture Notes in Mathematics, vol. 406, pp. 45–51. Springer-Verlag, Berlin Heidelberg New York (1974)
Híc, P., Nedela, R.: Balanced Integral Trees. Math. Slovaca 48(5), 429–445 (1998)
Híc, P., Pokorný, M.: On Integral Balanced Rooted Trees of Diameter 10. Acta Univ. M. Belii Math. 10, 9–15 (2003)
Li, X.L., Lin, G.N.: On Trees with Integer Eigenvalues. Kexue Tongbao (Chinese Science Bulletin) (in Chinese) 32 (11), pp. 813–816 (1987), or On Integral Trees Problems. Kexue Tongbao (English Ed.) (in English) 33 (10), pp. 802–806 (1988)
Li, X.L., Wang, L.G.: Integral Trees—A Survey. Chinese Journal of Engineering Math. 17, 91–93 (2000)
Liu, R.Y.: Integral Trees of Diameter 5. J. Systems Sci. Math. Sci. 8(4), 357–360 (1988)
Lepović, M.: On Integral Graphs which Belong to the Class \(\overline{\alpha K_{a, b}}\). Graphs Combin. 19(4), 527–532 (2003)
Lepović, M.: On Integral Graphs which Belong to the Class \(\stackrel{\rule{18.5mm}{.2mm}}{\alpha K_a \cup \beta K_{b,\,b}}\). Discrete Math. 285(1-3), 183–190 (2004)
Roitman, M.: An Infinite Family of Integral Graphs. Discrete Math. 52(2-3), 313–315 (1984)
Schwenk, A.J.: Exactly Thirteen Connected Cubic Graphs Have Integral Spectra. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 516–533. Springer, Berlin Heidelberg New York (1992)
Wang, L.G., Li, X.L.: Some New Classes of Integral Trees with Diameters 4 and 6. Australasian J. Combinatorics 21, 237–243 (2000)
Wang, L.G., Li, X.L., Hoede, C.: Two Classes of Integral Regular Graphs. Ars. Combinatoria 76, 303–319 (2005)
Wang, L.G., Li, X.L., Hoede, C.: Integral Complete r-Partite Graphs. Discrete Math. 283(1-3), 231–241 (2004)
Wang, L.G., Li, X.L., Yao, X.J.: Integral Trees with Diameters 4, 6 and 8. Australasian J. Combinatorics 25, 29–44 (2002)
Wang, L.G., Li, X.L., Zhang, S.G.: Construction of Integral Graphs. Appl. Math. J. Chinese Univ. Ser. B 15(3), 239–246 (2000)
Wang, L.G., Li, X.L., Zhang, S.G.: Families of Integral Trees with Diameters 4, 6 and 8. Discrete Appl. Math. 136(2), 349–362 (2004)
Watanabe, M., Schwenk, A.J.: Integral Startlike Trees. J. Austral. Math. Soc. Ser. A 28, 120–128 (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Sun, H. (2007). Three Classes of Bipartite Integral Graphs. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)