The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 26-29
In this paper, the double star like graphs $T(p,n,p-2)$, which is coalesced from two stars $K_{1,p}$ and $K_{1,p-2}$ by identifying the center of $K_{1,p}$ with one end of a path $P_n$ and the center of $K_{1,p-2}$ with the other end of $P_n$, is determined by its Laplacian spectrum.
Double starlike graph, Laplacian spectrum, cospectral graphs

P. Lu and Z. Yuan, "Double Starlike Graphs with Largest and Second Largest Degree Difference 2 Determined by Their Laplacian Spectrum," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 26-29.
79 ms
(Ver 3.3 (11022016))