Results 121 to 130 of about 302,460 (378)

On the Main Signless Laplacian Eigenvalues of a Graph [PDF]

open access: yesarXiv, 2012
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues, and then ...
arxiv  

LRSSLMDA: Laplacian Regularized Sparse Subspace Learning for MiRNA-Disease Association prediction

open access: yesPLoS Comput. Biol., 2017
Predicting novel microRNA (miRNA)-disease associations is clinically significant due to miRNAs’ potential roles of diagnostic biomarkers and therapeutic targets for various human diseases.
Xing Chen, Li Huang
semanticscholar   +1 more source

Strongly Regular Graphs as Laplacian Extremal Graphs [PDF]

open access: yes, 2014
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph.
Lin, Fan-Hsuan, Weng, Chih-wen
core  

Hodge Laplacians on Graphs [PDF]

open access: yesSIAM Review, 2020
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is simplicity, requiring only knowledge of linear algebra and graph theory.
openaire   +3 more sources

On the spectrum of the hierarchical Laplacian [PDF]

open access: yesPotential Analysis, 2014
Let $(X,d)$ be a locally compact separable ultrametric space. We assume that $(X,d)$ is proper, that is, any closed ball $B$ in $X$ is a compact set. Given a measure $m$ on $X$ and a function $C(B)$ defined on the set of balls (the choice function), we define the hierarchical Laplacian $L_C$ which is closely related to the concept of the hierarchical ...
Paweł Krupski, Alexander Bendikov
openaire   +4 more sources

Reactivity of Pnictaalumenes towards 1,3‐Dipole Molecules

open access: yesAngewandte Chemie International Edition, Accepted Article.
Alkynes undergo 1,3‐dipolar cyclisation reactions with organic azides giving 1,2,3‐triazoles. Pnictaalumenes RPn=AlRˈ are the isoelectronic congeners of alkynes, hence a similar reactivity towards 1,3‐dipole molecules is expected. Herein, we report the reactions of DippTerPn=AlCp* (DippTer = 2,6‑(2,6‐iPr2C6H3)‐C6H3, Cp* = [Me5C5]−, Pn = P, As) towards ...
Tim Wellnitz   +7 more
wiley   +1 more source

An Interpretation of the Geometric Meaning of the Finite Difference and the Function Derivative through the Use of the Finite Element Method Tools

open access: yesМеханика машин, механизмов и материалов, 2016
In the present article on the basis of earlier formulated planspatial problem of the finite elements method the concept of finite differences for the twodimensional continuous environment is developed.
Hrant A. Gevorgyan
doaj  

Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs

open access: yesJournal of Mathematics, 2021
Let G be a graph with Laplacian matrix LG. Denote by per LG the permanent of LG. In this study, we investigate the problem of computing the permanent of the Laplacian matrix of nonbipartite graphs.
Xiaoxue Hu, Grace Kalaso
doaj   +1 more source

Combinatorial and Hodge Laplacians: Similarity and Difference [PDF]

open access: yesarXiv, 2022
As key subjects in spectral geometry and combinatorial graph theory respectively, the (continuous) Hodge Laplacian and the combinatorial Laplacian share similarities in revealing the topological dimension and geometric shape of data and in their realization of diffusion and minimization of harmonic measures. It is believed that they also both associate
arxiv  

The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]

open access: yes, 2013
In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core  

Home - About - Disclaimer - Privacy