Results 21 to 30 of about 88,228 (240)
On the Aα-Spectral Radii of Cactus Graphs
Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications
Given a graph G, its adjacency matrix A(G) and its diagonal matrix of vertex degrees D(G), consider the matrix Aα (G) = αD(G) + (1 − α)A(G), where α ∈ [0, 1).
Cardoso Domingos M. +2 more
doaj +1 more source
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs [PDF]
The article gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from x to y is equal to the complex unity i (and its ...
Krystal Guo, B. Mohar
semanticscholar +1 more source
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Let G be a graph on n vertices, and let A( G ) and D ( G ) denote the adjacency matrix and the degree matrix of G, respectively. Define Aα ( G )= αD ( G )+( 1 - α ) A( G ) for any real α ∈ [ 0,1 ].
LIUShunyi,(柳顺义) +1 more
doaj +1 more source
Laplacian versus adjacency matrix in quantum walk search [PDF]
A quantum particle evolving by Schrödinger’s equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace’s operator.
T. G. Wong +2 more
semanticscholar +1 more source
On the Number of α-Labeled Graphs
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
A method of calculating the degree of freedom of foldable plate rigid origami with adjacency matrix
The mechanism with good fold performance derived from rigid origami is widely used in the field of engineering. In this article, the adjacency matrix method was proposed to analyze the degree of freedom of foldable plate rigid origami.
Hongyin Yu, Zhen Guo, Jia-ling Wang
semanticscholar +1 more source
Clustering Based on Eigenvectors of the Adjacency Matrix
The paper presents a novel spectral algorithm EVSA (eigenvector structure analysis), which uses eigenvalues and eigenvectors of the adjacency matrix in order to discover clusters.
Malgorzata Lucinska, S. Wierzchon
semanticscholar +1 more source
Phototrophs evolved light‐harvesting systems adapted for efficient photon capture in habitats enriched in far‐red radiation. A subset of eukaryotic pigment‐binding proteins can absorb far‐red photons via low‐energy chlorophyll states known as red forms.
Antonello Amelii +8 more
wiley +1 more source
This study investigates gene expression differences between two major pediatric acute lymphoblastic leukemia (ALL) subtypes, B‐cell precursor ALL, and T‐cell ALL, using a data‐driven approach consisting of biostatistics and machine learning methods. Following analysis of a discovery dataset, we find a set of 14 expression markers differentiating the ...
Mona Nourbakhsh +8 more
wiley +1 more source

