Graphs cospectral with multicone graphs KW 5 L(P)
AuthorAbdian, Ali Zeydi
MetadataShow full item record
CitationAbdian, A. Z. (2017). Graphs cospectral with multicone graphs KW 5 L(P). TWMS Journal Of Applied And Engineering Mathematics, 7(2), 181-187.
E. R. van Dam and W. H. Haemers  conjectured that almost all graphs are determined by their spectra. Nevertheless, the set of graphs which are known to be determined by their spectra is small. Hence, discovering infinite classes of graphs that are determined by their spectra can be an interesting problem. The aim of this paper is to characterize new classes of multicone graphs that are determined by their spectrum. A multicone graph is defined to be the join of a clique and a regular graph. It is proved that any graph cospectral with multicone graph Kw 5 L(P) is determined by its adjacency spectrum as well as its Laplacian spectrum, where Kw and L(P) denote a complete graph on w vertices and the line graph of the Petersen graph, respectively. Finally, three problems for further researches are proposed.
SourceTWMS Journal Of Applied And Engineering Mathematics
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Let G(V (G), E(G)) be a simple connected graph and dG(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying ...
The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal ...
A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. ...