Results 61 to 70 of about 1,705,971 (292)

The Adjacency Matrix and the Discrete Laplacian Acting on Forms [PDF]

Mathematical Physics, Analysis and Geometry, 2019
We study the relationship between the adjacency matrix and the discrete Laplacian acting on 1-forms. We also prove that if the adjacency matrix is bounded from below it is not necessarily essentially self-adjoint. We discuss the question of essential self-adjointness and the notion of completeness.
Hatem Baloudi, Sylvain Golénia, Aref Jeribi   +2 more
openaire   +3 more sources

Near‐Micron Single‐Crystalline Mn‐Rich Cathodes With Exceptional Cycling Stability

Advanced Energy Materials, EarlyView.
Earth‐abundant single‐crystalline Mn‐rich DRX material faces a synthetic limit in particle‐size reduction. Our automated TEM workflow reveals interparticle compositional heterogeneity in early‐stage DRX, which forms minor orthorhombic impurities during cooling and necessitates prolonged annealing.
Eunryeol Lee, Tucker Holstun, Tara Mishra, Maciej Moździerz, Shilong Wang, Yanbao Fu, Peter Ercius, Alexander Pattison, Satoshi Hiroi, Koji Ohara, Vincent Battaglia, Haegyeom Kim, Akira Miura, Gerbrand Ceder   +13 more
wiley   +1 more source

The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs

Communications in Advanced Mathematical Sciences, 2018
The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj   +1 more source

The spectra of the adjacency matrix and Laplacian matrix for some balanced trees

Linear Algebra and its Applications, 2005
The authors express the spectra of the adjacency and the Laplacian matrices of an unweighted rooted tree of \(k\) levels, such that in each level the vertices have the same degree, in terms of the spectra of a set of symmetric tridiagonal matrices.
Rojo, O, Soto, R
openaire   +4 more sources

On some properties of the Laplacian matrix revealed by the RCM algorithm [PDF]

, 2016
summary:In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a
Palomares Chust, Alberto, Carrascosa, Carlos, Palomares, Alberto, Pedroche Sánchez, Francisco, Carrascosa Casamayor, Carlos, Rebollo, Miguel, Rebollo Pedruelo, Miguel, Pedroche, Francisco   +7 more
core   +1 more source

A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws

Advanced Intelligent Discovery, EarlyView.
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows, G. Zhang, S. Anand, Z. Chen, J. Lin, A. Desai, S. Martiniani, F. Caravelli   +7 more
wiley   +1 more source

A Note on the Laplacian Energy of the Power Graph of a Finite Cyclic Group

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi
In this study, the Laplacian matrix concept for the power graph of a finite cyclic group is redefined by considering the block matrix structure. Then, with the help of the eigenvalues of the Laplacian matrix in question, the concept of Laplacian energy ...
Şerife Büyükköse, Nurşah Mutlu Varlıoğlu   +1 more
doaj   +1 more source

Network Coherence in a Family of Book Graphs

Frontiers in Physics, 2020
In this paper, we study network coherence characterizing the consensus behaviors with additive noise in a family of book graphs. It is shown that the network coherence is determined by the eigenvalues of the Laplacian matrix.
Jing Chen, Yifan Li, Weigang Sun
doaj   +1 more source

On Marker Set Distance Laplacian Eigenvalues in Graphs [PDF]

, 2018
In our previous paper, we had introduced the marker set distance matrix and its eigenvalues. In this paper, we extend them naturally to the Laplacian eigenvalues.
Medha Itagi Huilgol, ., Anuradha, S.
core   +2 more sources

Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics

Advanced Intelligent Discovery, EarlyView.
Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong, Zijian Huang, Xuanwu Wang, Zhenghui Feng, Wei Liu, Bingding Huang   +5 more
wiley   +1 more source