the corona G1 οG2 is defined as the graph obtained by taking n1 copies of G2 and for each i(i = 1
2
...
n1) inserting edges between vi and each vertex of the ith copy of G2. In [2]
for a connected graph G1 and a r-regular graph G2
S.Barik
S.Pati and B.K.Sarma provided complete information about the adjacency spectrum of G1 οG2. Following [2]
we further consider the adjacency spectrum of the corona graph G1οG2 in the case of non-regular G2. And we completely characterize the adjacency spectrum of G1οKm1
m2
where Km1
m2 is a complete bipartite graph.
关键词
Keywords
references
Cvetkovic D M,Doob M,Sachs H.Spectra of Graphs[M].Now York:Academic Press,1980.
Barik S,Pati S,Sarma B K.The spectrum of the corona of two graphs[J].Discrete Mathematics,2007,21:47-56.
Barik S,Neumann M,Pati S.On nonsingular trees and a reciprocal eigenvalue property[J].Linear Multilinear Algebra,2006,54:453-465.
Brualdi R A,Ryser H J.Combinatorial Matrix Theory,Encyclopedia of Mathematics and its Applications[M].Cambridge,UK:Cambridge University Press,1991.
Fiedler M.Algebraic connectivity of graphs[J].Czechoslovak Math J,1973,23:298-305.