Spectral characterizations of propeller graphs
Combinatorics
2014-02-18 v2
Abstract
A propeller graph is obtained from an -graph by attaching a path to the vertex of degree four, where an -graph consists of two cycles with precisely one common vertex. In this paper, we prove that all propeller graphs are determined by their Laplacian spectra as well as their signless Laplacian spectra.
Cite
@article{arxiv.1205.5943,
title = {Spectral characterizations of propeller graphs},
author = {Xiaogang Liu and Sanming Zhou},
journal= {arXiv preprint arXiv:1205.5943},
year = {2014}
}