Results 21 to 30 of about 57,585 (308)
Journal of Mathematics, 2021 Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj +1 more source
Diffusive representations for fractional Laplacian: systems theory framework and numerical issues [PDF]
, 2009 Bridging the gap between an abstract definition of pseudo-differential operators, such as (-\Delta)^{\gamma} for - 1/2 < \gamma < 1/2, and a concrete way to represent them has proved difficult; deriving stable numerical schemes for such operators is not ...
Matignon, Denis
core +1 more source
Mathematics, 2021 Unravelling how the human brain structure gives rise to function is a central question in neuroscience and remains partially answered. Recent studies show that the graph Laplacian of the human brain’s structural connectivity (SC) plays a dominant role in
Jichao Ma +3 more
doaj +1 more source
Laplacian Distribution and Domination [PDF]
Graphs and Combinatorics, 2017 Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $γ(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq γ(G)$, and show that isolate-free graphs also satisfy $γ(G) \leq m_G[2,n]$.
Domingos M. Cardoso +2 more
openaire +4 more sources
The Laplacian spread of graphs [PDF]
, 2009 summary:The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread,
Tan, Ying-Ying +4 more
core +1 more source
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj +1 more source
Hodge Laplacians on Graphs [PDF]
SIAM 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
Scaling Laplacian Pyramids [PDF]
SIAM Journal on Matrix Analysis and Applications, 2015 Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate when such matrices are scalable, that is when right multiplication by Laurent polynomial diagonal matrices ...
Youngmi Hur, Kasso A. Okoudjou
openaire +2 more sources
A class of digraphs which have completely real Laplacian spectra(一类具有全实Laplacian谱的有向图)
Zhejiang Daxue xuebao. Lixue ban, 2011 分别研究了一类带有Hamiltonian路和带有Hamiltonian圈的有向图的基本有圈性(essential cyclicity)，给出了这种有向图的Laplacian谱，表明这些图具有全实的Laplacian谱.
SULi(苏莉), LIHong-hai(李红海)
doaj +1 more source
An eigenvalue optimization problem for Dirichlet-Laplacian with a drift [PDF]
مدلسازی پیشرفته ریاضیIn this paper, we prove a monotonicity result related to the principal eigenvalue for Dirichlet-Laplacian with a drift operator in a punctured ball.
محسن زیوری رضاپور
doaj +1 more source