TY - GEN
T1 - Three Classes of Bipartite Integral Graphs
AU - Wang, Ligong
AU - Sun, Hao
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
KW - Characteristic polynomial
KW - Graph spectrum
KW - Integral graph
UR - http://www.scopus.com/inward/record.url?scp=49949109536&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-70666-3_22
DO - 10.1007/978-3-540-70666-3_22
M3 - 会议稿件
AN - SCOPUS:49949109536
SN - 3540706658
SN - 9783540706656
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 206
EP - 215
BT - Discrete Geometry, Combinatorics and Graph Theory 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers
T2 - 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005
Y2 - 22 November 2005 through 24 November 2005
ER -