Graphs cospectral with multicone graphs KW 5 L(P)
Citation
Abdian, A. Z. (2017). Graphs cospectral with multicone graphs KW 5 L(P). TWMS Journal Of Applied And Engineering Mathematics, 7(2), 181-187.Abstract
E. R. van Dam and W. H. Haemers [15] 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.
Volume
7Issue
2URI
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2622http://jaem.isikun.edu.tr/web/index.php/archive/96-vol7no2/295
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...