ON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
Authors
Abstract:
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs that are DS with respect to their spectrums. Also, we show that complement of these graphs are DS with respect to their adjacency spectrums. In addition, we show that graphs cospectral with these graphs are perfect. Finally, we find automorphism group of these graphs and one conjecture for further researches is proposed.
similar resources
on new classes of multicone graphs determined by their spectrums
a multicone graph is defined to be join of a clique and a regular graph. a graph $ g $ is cospectral with graph $ h $ if their adjacency matrices have the same eigenvalues. a graph $ g $ is said to be determined by its spectrum or ds for short, if for any graph $ h $ with $ spec(g)=spec(h)$, we conclude that $ g $ is isomorphic to $ h $. in this paper, we present new classes of multicone g...
full textthe impact of attending efl classes on the level of depression of iranian female learners and their attributional complexity
می توان گفت واقعیت چند لایه ا ی کلاس های زبان انگلیسی بسیار حائز اهمیت است، زیرا عواطف و بینش های زبان آموزان تحت تاثیر قرار می گیرد. در پژوهش پیش رو، گفته می شود که دبیران با در پیش گرفتن رویکرد فرا-انسانگرایی ، قادرند در زندگی دانش آموزانشان نقش مهمی را ایفا سازند. بر اساس گفته ی ویلیامز و بردن (2000)، برای کرل راجرز، یکی از بنیان گذاران رویکرد انسانگرایی ، یادگیری بر مبنای تجربه، نوعی از یاد...
Modules Determined by Their Annihilator Classes
We present a classification of those finite length modules X over a ring A which are isomorphic to every module Y of the same length such that Ker(HomA(−, X)) = Ker(HomA(−, Y )), i.e. X is determined by its length and the torsion pair cogenerated by X. We also prove the dual result using the torsion pair generated by X. For A right hereditary, we prove an analogous classification using the coto...
full textTHE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
full textGraphs determined by their (signless) Laplacian spectra
Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.
full textWhich graphs are determined by their spectrum?
For almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered. © 2003 Elsevier Inc. All rights reserved.
full textMy Resources
Journal title
volume 2 issue 1
pages 23- 34
publication date 2015-02-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023