| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648084 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
A graph is said to be DLS, if there is no other non-isomorphic graph with the same Laplacian spectrum. Let GG be a DLS graph. We show that G×KrG×Kr is DLS if GG is disconnected. If GG is connected, it is proved that G×KrG×Kr is DLS under certain conditions. Applying this result, we prove that G×KrG×Kr is DLS if GG is a tree on n(n⩾5) vertices or a unicyclic graph on n(n>6) vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jiang Zhou, Changjiang Bu,