Results 81 to 90 of about 13,572 (222)
Critical System Size for the Recovery of Topological Zero Modes in Finite Non‐Hermitian Systems
A generalized non‐Hermitian SSH model on a topolectrical circuit reveals size‐dependent topological zero modes. Non‐Hermiticity enables exact zero‐admittance edge states at a critical system size, tunable via asymmetric coupling and gain/loss. Large impedance peaks signal these modes, offering insights for designing robust topological devices with ...
S M Rafi‐Ul‐Islam +3 more
wiley +1 more source
Two Laplacians for the distance matrix of a graph
Abstract We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected graph, called the distance Laplacian and distance signless Laplacian , respectively. We show the equivalence between the distance signless Laplacian, distance Laplacian and the distance spectra for the class of transmission regular graphs.
Pierre Hansen, Mustapha Aouchiche
openaire +2 more sources
This work investigates the dynamic stability, chemical bonding and electronic properties of LaBH8 and LaBeH8 under pressure using first‐principles calculations. The authors reveal that LaBH8 contains strong covalent B–H bonds, while the Be–H bonds in LaBeH8 show ionic and covalent character. This study reveals the key chemical bonding character for the
Xiaokuan Hao +7 more
wiley +1 more source
Abstract This paper focuses on the issue of adaptive event‐triggered containment control for Markov jump multi‐agent systems characterized by hidden Markov jump parameters. The central objective is to design an output‐feedback controller for the Markov jump multi‐agent system by using an adaptive event‐triggered technique that not only ensures the ...
Parivallal Arumugam +3 more
wiley +1 more source
Combining non-negative matrix factorization with graph Laplacian regularization for predicting drug-miRNA associations based on multi-source information fusion [PDF]
Mei-Neng Wang +4 more
openalex +1 more source
Largest Eigenvalue of the Laplacian Matrix
Following an editorial request, this is the second part of the article originally available in arxiv:1405.4880v1, corresponding to Section 6 of that manuscript. Several clarification comments and improvements to the original exposition were added, and the introduction and background materials are new. No new mathematical content was added.
openaire +2 more sources
Matrix tree theorem for the net Laplacian matrix of a signed graph
For a simple signed graph $G$ with the adjacency matrix $A$ and net degree matrix $D^{\pm}$, the net Laplacian matrix is $L^{\pm}=D^{\pm}-A$. We introduce a new oriented incidence matrix $N^{\pm}$ which can keep track of the sign as well as the orientation of each edge of $G$. Also $L^{\pm}=N^{\pm}(N^{\pm})^T$.
openaire +2 more sources
Group inverse matrix of the normalized Laplacian on subdivision networks
In this paper we consider a subdivision of a given network and we show how the group inverse matrix of the normalized laplacian of the subdivision network is related to the group inverse matrix of the normalized laplacian of the initial given network.
Carmona Mejías, Ángeles +2 more
openaire +6 more sources
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +1 more source
Laplacian and signless laplacian spectra and energies of multi-step wheels
Energies and spectrum of graphs associated to different linear operators play a significant role in molecular chemistry, polymerisation, pharmacy, computer networking and communication systems.
Zheng-Qing Chu +4 more
doaj +1 more source

