نتایج جستجو برای: Adjacency spectrum
تعداد نتایج: 228694 فیلتر نتایج به سال:
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...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
A graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency and Laplacian spectrum, respectively. It is known that connected graphs of index less than 2 are determined by their adjacency spectrum. In this paper, we focus on the problem of characterization of DS graphs of index less th...
The spectrum of a matrix M is the multiset that contains all the eigenvalues of M. If M is a matrix obtained from a graph G, then the spectrum of M is also called the graph spectrum of G. If two graphs has the same spectrum, then they are cospectral (or isospectral) graphs. In this paper, we compare four spectra of matrices to examine their accuracy in protein structural comparison. These four ...
We present the new and unexpected results concerning the Bose–Einstein Condensation for the Pure Hopping Model, describing the thermodynamic behaviour of Bardeen–Cooper pairs in arrays of Josephson junctions located on non homogeneous amenable networks. For this particular situation arising from physics, the results are obtained by a detailed analysis concerning harmonic analysis of the adjacen...
altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید