Laplacian spectral characterization of clover graphs

Luhua Wang; Ligong Wang

doi:10.1080/03081087.2015.1014463

Laplacian spectral characterization of clover graphs

Luhua Wang
, Ligong Wang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	2396-2405
Number of pages	10
Journal	Linear and Multilinear Algebra
Volume	63
Issue number	12
DOIs	https://doi.org/10.1080/03081087.2015.1014463
State	Published - 2 Dec 2015

Keywords

determined by Laplacian spectrum
Laplacian spectrum

Access to Document

10.1080/03081087.2015.1014463

Cite this

@article{ef3f52404e744943a1fc7553836f2ded,

title = "Laplacian spectral characterization of clover graphs",

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.",

keywords = "determined by Laplacian spectrum, Laplacian spectrum",

author = "Luhua Wang and Ligong Wang",

note = "Publisher Copyright: {\textcopyright} 2015 Taylor \& Francis.",

year = "2015",

month = dec,

day = "2",

doi = "10.1080/03081087.2015.1014463",

language = "英语",

volume = "63",

pages = "2396--2405",

journal = "Linear and Multilinear Algebra",

issn = "0308-1087",

publisher = "Taylor and Francis Ltd.",

number = "12",

}

TY - JOUR

T1 - Laplacian spectral characterization of clover graphs

AU - Wang, Luhua

AU - Wang, Ligong

PY - 2015/12/2

Y1 - 2015/12/2

N2 - 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.

AB - 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.

KW - determined by Laplacian spectrum

KW - Laplacian spectrum

UR - https://www.scopus.com/pages/publications/84942828052

U2 - 10.1080/03081087.2015.1014463

DO - 10.1080/03081087.2015.1014463

M3 - 文章

AN - SCOPUS:84942828052

SN - 0308-1087

VL - 63

SP - 2396

EP - 2405

JO - Linear and Multilinear Algebra

JF - Linear and Multilinear Algebra

IS - 12

ER -

Laplacian spectral characterization of clover graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this