the spectrum of a (finite, directed or undirected) graph G which can be investigated by the general methods of representation theory, or by more direct methods.aut G can be represented as the group g ( A ) of all permutation matrices P which commute with the adjacency matrix A of G . ...
Summary: Let G be a graph. The Laplacian matrix $L(G)=D(G)-A(G)$ is the difference of the diagonal matrix of vertex degrees and the 0-1 adjacency matrix. Various aspects of the spectrum of L(G) are investigated. Particular attention is given to multiplicities of integer eigenvalues an...
摘要: We survey the results obtained by a large number of authors concerning the spectrum of a graph. The questions of characterisation by spectrum, cospectral graphs and information derived from the spectrum are discussed.年份: 2022 收藏 引用 批量引用 报错 分享 全部来源 免费下载 求助全文 ...
We deal with the question: Can one see from the spectrum of a graph Г whether it is distance-regular or not? Up till now the answer has not been known when Г has precisely four distinct eigenvalues (the diameter 3 case). We show that in this case the answer is negative. We also ...
THE SPECTRUM OF THE AVERAGING OPERATOR ON A NETWORK (METRIC GRAPH) A network is a countable, connected graph X viewed as a one-complex, where each edge [x,y] = [y,x] (x,y ∈ X~0, the vertex set) is a copy of the unit inter... DONALD I. CARTWRIGHT,WOLFGANG WOESS - 《...
Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph. Yang Wang,Zengru Di,Ying Fan.Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph[J].PLoS ONE,2011,6(11... Y Wang,Z Di,Y Fan - 《Plos One...
Let a finite group G of odd order n act regularly on a connected (multi-)graph u0393. That is, no group element other than the identity fixes any vertex. Then the u201cquotient graphu201d u0394 under the action is the induced graph of orbits. We give a result about the connectivity...
We consider a quantum graph as a model of graphene in magnetic fields and give a complete analysis of the spectrum, for all constant fluxes. In particular,
Let σ be an orientation of a simple graph H yielding an oriented graph H σ . We define an orientation ψ to the Cartesian product G = H □ Q d of H with the hypercube Q d by orienting the edges of G in a specific way. The skew adjacency matrices S ( G ψ ) obtained in thi...
on a network graph Spectrum of a family of difference operators on functions on a network graphSpectrum of a family of difference operators on functions on a network graphIN problems on the oscillations of jointed rod structures, on flooding at a river with a branched channel, on the ...