Connected graphs cospectral with a Friendship graph
Let $n$ be any positive integer, the friendship graph $F_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same eigenvalues. Recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2014-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/pdf_4975_b084afb2f80121996ddeade80cc392f1.html |