Results 1 to 10 of about 249,760 (328)
Applied SciencesAccurate characterization of rail corrugation is essential for the operation and maintenance of urban rail transit. To enhance the representation capability for rail corrugation, this study proposes a sound–vibration feature fusion method based on ...
Yun Liao +4 more
doaj +1 more source
Asymptotic Laplacian-Energy-Like Invariant of Lattices [PDF]
, 2014 Let $\mu_1\ge \mu_2\ge\cdots\ge\mu_n$ denote the Laplacian eigenvalues of $G$ with $n$ vertices. The Laplacian-energy-like invariant, denoted by $LEL(G)= \sum_{i=1}^{n-1}\sqrt{\mu_i}$, is a novel topological index.
Hu, Feng-Feng +3 more
core
Journal of Physics CommunicationsSoft materials, including diblock copolymers, are advancing nanotechnology due to their unique properties, applications materials include energy harvesting, water sanitation, environmental treatment, nanosensors, drug delivery and nanolithography.
Muhammad Javed Iqbal +2 more
doaj +1 more source
Monophonic Distance Laplacian Energy of Transformation Graphs Sn^++-,Sn^{+-+},Sn^{+++}
Ratio Mathematica, 2023 Let $G$ be a simple connected graph of order $n$, $v_{i}$ its vertex. Let $\delta^{L}_{1}, \delta^{L}_{2}, \ldots, \delta^{L}_{n}$ be the eigenvalues of the distance Laplacian matrix $D^{L}$ of $G$. The distance Laplacian energy is denoted by $LE_{D}(G)$.
Diana R, Binu Selin T
doaj +1 more source
GEUS BulletinThis study presents a probabilistic method for extracting informed points from geological surfaces, named INPOX. The method generates a probability map from the existing surface by calculating the Laplacian at each location and combining it with a user ...
Rasmus Bødker Madsen +3 more
doaj +1 more source
More on Spectral Analysis of Signed Networks
Complexity, 2018 Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity
Guihai Yu, Hui Qu
doaj +1 more source
Laplacian energy and first Zagreb index of Laplacian integral graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul +2 more
doaj +1 more source
A nodal domain theorem and a higher-order Cheeger inequality for the graph $p$-Laplacian [PDF]
, 2016 We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While for $p>1$ the
Hein, Matthias, Tudisco, Francesco
core +1 more source
On the Approximation of Laplacian Eigenvalues in Graph Disaggregation
, 2016 Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in
Hu, Xiaozhe +2 more
core +1 more source
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
, 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