New sufficient conditions for integral complete 3-partite graphs | Zendy

Pavel Hí­c | Zendy; Milan Pokorný | Zendy; Pavol Cernek | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New sufficient conditions for integral complete 3-partite graphs

Author(s) -

Pavel Híc,

Milan Pokorný,

Pavol Cernek

Publication year - 2008

Publication title -

applicable analysis and discrete mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.69

H-Index - 26

eISSN - 2406-100X

pISSN - 1452-8630

DOI - 10.2298/aadm0802276h

Subject(s) - mathematics , adjacency matrix , eigenvalues and eigenvectors , integral graph , combinatorics , graph , discrete mathematics , construct (python library) , adjacency list , two graph , line graph , voltage graph , graph power , computer science , physics , quantum mechanics , programming language

A graph is integral if all the eigenvalues of its adjacency matrix are integers. In this paper we give sufficient conditions for complete 3-partite graphs to be integral, from which we construct infinitely many new classes of such integral graphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research