Results 121 to 130 of about 57,585 (308)
New constructions of nonregular cospectral graphs
Special MatricesWe consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
Color signless Laplacian energy of graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj +1 more source
Advanced Intelligent Systems, EarlyView.Single‐cell Spatial Transcriptomics Analysis and Denoising Engine is introduced as a unified deep learning framework that jointly performs denoising, clustering, and gene prioritization in spatial transcriptomics. By integrating linear and nonlinear representations within a dual‐channel architecture, it improves robustness and accuracy, uncovers ...
Yaxuan Cui +11 more
wiley +1 more source
The Laplacian spectrum of weighted composite networks and the applications
AIP AdvancesThe topological properties of the networks can be described by the Laplacian spectra, but resolving the Laplacian spectra of networks poses difficulties. In this study, a novel approach for solving the Laplacian spectrum of weighted composite networks is
Jian Zhu +3 more
doaj +1 more source
, 2013 Summary: Let \(G\) be a connected graph of order \(n\) with Laplacian eigenvalues \(\mu_1\geq\mu_2\geq\cdots\geq\mu_{n-1}>\mu_n=0\). The Laplacian energy of the graph \(G\) is defined as \(LE=LE(G)=\sum_{i=1}^n| \mu_i-2m/n| \). Upper bounds for \(LE\) are obtained in terms of \(n\) and the number of edges \(m\).
Das, Kinkar Ch. +3 more
openaire +3 more sources
A NOTE ON THE LEAST (NORMALIZED) LAPLACIAN EIGHVA;UE OF SIGNED GRAPHS [PDF]
, 2017 Let Γ=(G,σ)Γ=(G,σ) be a connected signed graph, and L(Γ)L(Γ) be its Laplacian and L(Γ)L(Γ) its normalized Laplacian with eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn and μ1≥μ2≥⋯≥μnμ1≥μ2≥⋯≥μn, respectively.
Li, Hui Shu;Li, Hong Hai
core +1 more source
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Advanced Intelligent Systems, EarlyView.Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
Layered Multitask Tracker via Spatial-Temporal Laplacian Graph [PDF]
, 2017 Most multitask trackers define the trace of each candidate as one task, and assume all tasks are equally related. Multitask learning is only evaluated on the current frame.
Li XM(李小毛) +2 more
core
On the Laplacian and fractional Laplacian in an exterior domain
Advances in Differential Equations, 2012 We see that the generalized Fourier transform due to A.G. Ramm for the case of $n=3$ space dimensions remains valid, with some modifications, for all space dimensions $n\ge 2$. We use the resulting spectral representation of the exterior Laplacian to study exterior problems. In particular the Fourier splitting method developed by M.E.
Kosloff, Leonardo, Schonbek, Tomas
openaire +2 more sources
New bounds on the Laplacian spectral ratio of connected graphs [PDF]
summary:Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$ is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is an important parameter in graph theory and networks.
Lin, Zhen, Cai, Min, Wang, Jiajia
core +1 more source