Laplacian spectral characterization of clover graphs

Luhua Wang, Ligong Wang

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

A clover graph is obtained from a 3-rose graph by attaching a path to the vertex of degree six, where a 3-rose graph consists of three cycles with precisely one common vertex. In this paper, it is proved that all clover graphs are determined by their Laplacian spectra.

Original languageEnglish
Pages (from-to)2396-2405
Number of pages10
JournalLinear and Multilinear Algebra
Volume63
Issue number12
DOIs
StatePublished - 2 Dec 2015

Keywords

  • determined by Laplacian spectrum
  • Laplacian spectrum

Fingerprint

Dive into the research topics of 'Laplacian spectral characterization of clover graphs'. Together they form a unique fingerprint.

Cite this