On the spectral characterizations of 3-rose graphs

Authors

  • Wang, Jianfeng
  • Huang, Qiongxiang
  • Belardo, Francesco

Abstract

A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vertex in common. In this paper, we prove that all 3-rose graphs, having at least one triangle, are determined by their Laplacian spectra and all 3-rose graphs axe determined by their signless Laplacian spectra.

Published

2013-06-09

How to Cite

Wang, Jianfeng, Huang, Qiongxiang, & Belardo, Francesco. (2013). On the spectral characterizations of 3-rose graphs. Utilitas Mathematica, 91. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/967

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.