The dumbbell graph, denoted by D a,b,c , is a bicyclic graph consisting of two vertex-disjoint cycles C a and C b joined by a path P c+3 (c -1) having only its end-vertices in common with the two cycles. By using a new cospectral invariant for (r, r + 1)-almost regular graphs, we will show that almo
A note on the spectral characterization of -graphs
β Scribed by F. Ramezani; N. Broojerdian; B. Tayfeh-Rezaie
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 145 KB
- Volume
- 431
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, some sufficient conditions are given on a graph G, under which it is proved that G {x} is determined by the generalized spectrum iff G is determined by the generalized spectrum, where G {x} is the graph obtained from the graph G by adding an isolated vertex x.
## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, Ξ³(__H__) = __i__(__H__), where Ξ³ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of