Skip to main content
Log in

On the seidel integral complete multipartite graphs

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

For a simple undirected graph G, denote by A(G) the (0,1)-adjacency matrix of G. Let thematrix S(G) = J-I-2A(G) be its Seidel matrix, and let S G (λ) = det(λI-S(G)) be its Seidel characteristic polynomial, where I is an identity matrix and J is a square matrix all of whose entries are equal to 1. If all eigenvalues of S G (λ) are integral, then the graph G is called S-integral. In this paper, our main goal is to investigate the eigenvalues of S G (λ) for the complete multipartite graphs G = \(G = K_{n_1 ,n_2 ,...n_t } \). A necessary and sufficient condition for the complete tripartite graphs K m,n,t and the complete multipartite graphs

to be S-integral is given, respectively.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Balińska, K.T., Cvetković, D., Lepović, M., Simić, S. There are exactly 150 connected integral graphs up to 10 vertices. Univ. Beograd. Publ. Elektrotehn. Fak, Ser. Mat., 10: 95–105 (1999)

    MathSciNet  MATH  Google Scholar 

  2. Balińska, K.T., Cvetković, D., Radosavljević, Z., Simić, S.K., Stevanović, D. A survey on integral graphs. Univ. Beograd. Pull. Elektrotehn. Fak. Ser. Mat., 13: 42–65 (2002)

    MATH  Google Scholar 

  3. Balińska, K.T., Kupczyk, M., Simić, S.K., Zwjerzyński, K.T. On generating all integral graphs on 11 vertices. The Technical University of Poznan, Computer Science Center Report, 469, 1999/2000

  4. Balińska, K.T., Kupczyk, M., Simić, S.K., Zwierzyński, K.T. On generating all integral graph on 12 vertices. The Technical Unicersity of Poznan, Computer Science center Report, No.482, 2001

  5. Bondy, J.A., Murty, U.S.R. Graph Theory with Applications. Macmillan, 1976

  6. Grone, R., Merris, R. The Laplacian spectrum of a graph. SIAM. J. Discrete Math., 7: 221–229 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Harary, F., Schwenk, A.J. Which graphs have integral spectral? In: Graphs and Combinatorics, (eds, R. Bari and F. Harary), (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), Lecture Notes in Mathematics 406, Springer-Verlag, Berlin, 1974, 45–51

    Chapter  Google Scholar 

  8. Lu, S.F. On the signless Laplacian spectrum of the complete multipartite graphs. Master Thesis, Qinghai Nationality University, 2009

  9. Merris, R. Degree maximal graphs are Laplacian integral. Linear Algebra Appl., 199: 381–389 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Stevanović, D. Research problems from the Aveiro Workshop on Graph Spectra. Linear Algebra Appl., 423: 172–181 (2007)

    Article  MathSciNet  Google Scholar 

  11. Simić, S.K., Stanic, Z. Q-integral graphs with edge-degrees at most five. Discrete Math., 308: 4625–4634 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wang L.G., Liu, X.D. Integral complete multipartite graphs. Discrete Math., 308: 3860–3870 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hai-xing Zhao.

Additional information

Supported by the National Natural Science Foundation of China (No. 60863006) and by Program for New Century Excellent Talents in University (No. 06-0912)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lv, Sm., Wei, L. & Zhao, Hx. On the seidel integral complete multipartite graphs. Acta Math. Appl. Sin. Engl. Ser. 28, 705–710 (2012). https://doi.org/10.1007/s10255-012-0126-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-012-0126-x

Keywords

2000 MR Subject Classification

Navigation