Results 31 to 40 of about 150,247 (249)
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Zhejiang Daxue xuebao. Lixue ban, 2019 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
A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks [PDF]
, 2017 This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks. The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random graph model that
A Anandkumar +14 more
core +4 more sources
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 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
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
, 2017 With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi +1 more
core +1 more source
Hua's fundamental theorem of geometry of rectangular matrices over EAS division rings
, 2015 The fundamental theorem of geometry of rectangular matrices describes the general form of bijective maps on the space of all $m\times n$ matrices over a division ring $\mathbb{D}$ which preserve adjacency in both directions.
Pazzis, Clément de Seguins +1 more
core +2 more sources
The algebra of adjacency patterns: Rees matrix semigroups with reversion [PDF]
, 2009 We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of reversion.
D.M. Clark +18 more
core +2 more sources
Perturbation of the α-spectral radius of complete multipartite graphs
上海师范大学学报. 自然科学版Let G be a graph and α∈[0, 1), Nikiforov merged the adjacency matrix and the signless Laplacian matrix to Aα(G)=αD(G)+(1-α)A(G), where D(G), A(G) are the degree diagonal matrix and the adjacency matrix of G, respectively.
WU Yuhao +3 more
doaj +1 more source
On the Adjacency Matrix of RyR2 Cluster Structures
PLoS Comput. Biol., 2015 In the heart, electrical stimulation of cardiac myocytes increases the open probability of sarcolemmal voltage-sensitive Ca2+ channels and flux of Ca2+ into the cells.
M. A. Walker +6 more
semanticscholar +1 more source
Spectra of general hypergraphs
, 2017 Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are ...
Banerjee, Anirban +2 more
core +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source