Skip to main content
SpringerLink
Log in
Book cover

China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory

CJCDGCGT 2005: Discrete Geometry, Combinatorics and Graph Theory pp 206–215Cite as

Three Classes of Bipartite Integral Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4381))

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.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    MathSciNet  MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    MATH  Google Scholar 

  4. 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)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)

    Google Scholar 

  6. Cao, Z.F.: On the Integral Trees of Diameter R when 3 ≤ R ≤ 6. J. Heilongjiang University 2(1-3), 95 (1988)

    Google Scholar 

  7. Cao, Z.F.: Some New Classes of Integral Trees with Diameter 5 or 6. J. Systems Sci. Math. Sci. 11(1), 20–26 (1991)

    MathSciNet  MATH  Google Scholar 

  8. Cao, Z.F.: Introductory Diophantine Equations. Haerbin: Haerbin Polytechnical University Press (1989)

    Google Scholar 

  9. Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs—Theory and Application. Academic Press, New York, Francisco. London (1980)

    Google Scholar 

  10. Cvetković, D., Simić, S.K., Stevanović, D.: 4-Regular Integral Graphs. Univ. Beograde. Publ. Elektrotehn. Fak. Ser. Mat. 9, 89–102 (1998)

    MATH  Google Scholar 

  11. Hansen, P., Mélot, H.: Computers and Discovery in Algebraic Graph Theory. Linear Algebra Appl. 356, 211–230 (2002)

    MathSciNet  MATH  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Híc, P., Nedela, R.: Balanced Integral Trees. Math. Slovaca 48(5), 429–445 (1998)

    MathSciNet  Google Scholar 

  14. Híc, P., Pokorný, M.: On Integral Balanced Rooted Trees of Diameter 10. Acta Univ. M. Belii Math. 10, 9–15 (2003)

    MATH  Google Scholar 

  15. 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)

    Google Scholar 

  16. Li, X.L., Wang, L.G.: Integral Trees—A Survey. Chinese Journal of Engineering Math. 17, 91–93 (2000)

    Google Scholar 

  17. Liu, R.Y.: Integral Trees of Diameter 5. J. Systems Sci. Math. Sci. 8(4), 357–360 (1988)

    MathSciNet  MATH  Google Scholar 

  18. Lepović, M.: On Integral Graphs which Belong to the Class \(\overline{\alpha K_{a, b}}\). Graphs Combin. 19(4), 527–532 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. 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)

    Google Scholar 

  20. Roitman, M.: An Infinite Family of Integral Graphs. Discrete Math. 52(2-3), 313–315 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  21. 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)

    Google Scholar 

  22. Wang, L.G., Li, X.L.: Some New Classes of Integral Trees with Diameters 4 and 6. Australasian J. Combinatorics 21, 237–243 (2000)

    Google Scholar 

  23. Wang, L.G., Li, X.L., Hoede, C.: Two Classes of Integral Regular Graphs. Ars. Combinatoria 76, 303–319 (2005)

    MathSciNet  MATH  Google Scholar 

  24. Wang, L.G., Li, X.L., Hoede, C.: Integral Complete r-Partite Graphs. Discrete Math. 283(1-3), 231–241 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wang, L.G., Li, X.L., Yao, X.J.: Integral Trees with Diameters 4, 6 and 8. Australasian J. Combinatorics 25, 29–44 (2002)

    MathSciNet  MATH  Google Scholar 

  26. 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)

    Article  MathSciNet  MATH  Google Scholar 

  27. 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)

    Article  MathSciNet  MATH  Google Scholar 

  28. Watanabe, M., Schwenk, A.J.: Integral Startlike Trees. J. Austral. Math. Soc. Ser. A 28, 120–128 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, P.R. China

    Ligong Wang & Hao Sun

Authors
  1. Ligong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hao Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin Akiyama William Y. C. Chen Mikio Kano Xueliang Li Qinglin Yu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation