Results 31 to 40 of about 175,546 (265)
The distance spectrum of corona and cluster of two graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source
Eigenvalue −1 of the Vertex Quadrangulation of a 4-Regular Graph
AxiomsThe vertex quadrangulation QG of a 4-regular graph G visually looks like a graph whose vertices are depicted as empty squares, and the connecting edges are attached to the corners of the squares.
Vladimir R. Rosenfeld
doaj +1 more source
On the Spectrum of a Complete Multipartite Graph
European Journal of Combinatorics, 1980 The spectrum S(G) of a graph G is defined as the sequence of eigenvalues of its adjacency matrix. The spectrum of a complete multipartite graph K has several remarkable properties. John Smith has shown that a graph has exactly one positive eigenvalue if and only if the non-isolated points form a complete multipartite graph.
Friedrich Esser, Frank Harary
openaire +2 more sources
Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers
EntropyWe address the problem of the distributed computation of arbitrary functions of two correlated sources, X1 and X2, residing in two distributed source nodes, respectively.
Mohammad Reza Deylam Salehi, Derya Malak
doaj +1 more source
Some Algebraic Properties of a Class of Integral Graphs Determined by Their Spectrum
Journal of Mathematics, 2021 Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, then we say that Γ is an integral graph. A graph Γ is determined by its spectrum if every graph cospectral to it is in fact isomorphic to it. In this paper,
Jia-Bao Liu +2 more
doaj +1 more source
Bounds on spectrum graph coloring [PDF]
Electronic Notes in Discrete Mathematics, 2016 Ministerio de Economía y ...
Orden Martín, David +3 more
openaire +2 more sources
On the Spectrum of the Generalised Petersen Graphs [PDF]
Graphs and Combinatorics, 2016 We show that the gap between the two greatest eigenvalues of the generalised Petersen graphs $P(n,k)$ tends to zero as $n \rightarrow \infty$. Moreover, we provide explicit upper bounds on the size of this gap. It follows that these graphs have poor expansion properties for large values of $n$. We also show that a positive proportion of the eigenvalues
openaire +4 more sources
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
LAPLACIAN SPECTRUM AND ENERGY OF NON-COMMUTING GRAPHS OF FINITE RINGS [PDF]
Journal of Algebraic SystemsWe compute spectrum, energy, Laplacian spectrum/ energy and signless Laplacian spectrum/energy of non-commuting graphs of certain finite non-commutative rings. In particular, we consider finite rings $R$ such that $|R| = p^2, p^3, p^4$, $p^5$, $p^2q$ and
Monalisha Sharma, Rajat Nath
doaj +1 more source
Reconstruction of Weighted Graphs by their Spectrum
European Journal of Combinatorics, 2000 A weighted graph \(G\) is a pair \((A,M)\) where \(A\) and \( M\) are two matrices with \(A_{ii}=0\) and \(M\) is real diagonal. If the mass coefficients \(m_i\) are equal to 1, then \(G\) is a simple graph. If \(m_i >0\) and \(A_{ij} \geq 0\), the weighted graph is a model for a molecule or, alternatively, a discrete model of an inhomogeneous drum ...
Lorenz Halbeisen, Norbert Hungerbühler
openaire +1 more source