Results 81 to 90 of about 14,497 (259)
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Ganie HA, Shang Y.
europepmc +1 more source
Nanoscale Thermal Transport in Bi2(Te, Se)3 Thermoelectric Material Using Pulsed STEM
The pulsed‐STEM technique enables simultaneous acquisition of crystallographic, compositional, and thermal transport information within a single experiment. In anisotropic Bi2(Te, Se)3, phase‐delay imaging visualizes directional heat flow and interfacial resistance at the nanoscale, offering a new approach to understanding and designing thermoelectric ...
Hyunyong Cho +5 more
wiley +1 more source
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +1 more source
Oversampled Graph Laplacian Matrix For Graph Signals
Publication in the conference proceedings of EUSIPCO, Lisbon, Portugal ...
Akie Sakiyama, Yuichi Tanaka 0001
openaire +3 more sources
Permanent of the Laplacian matrix of trees and bipartite graphs
Let \(G=(V,E)\) be a graph without loops and multiple edges with vertex set \(V=\{v_ 1,...,v_ n\}\) and edge set E. Suppose the degree of vertex \(v_ i\) equals \(d_ i\) for \(i=1,...,n\) and let \(D=D(G)\) be the diagonal matrix whose (i,i)-entry is \(d_ i\).
Richard A. Brualdi, John L. Goldwasser
openaire +1 more source
On structural controllability in complex networks with periodic switching topologies
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
On the Seidel Laplacian spectrum of threshold graphs [PDF]
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj +1 more source
Robust joint clustering of multi-omics single-cell data via multi-modal high-order neighborhood Laplacian matrix optimization. [PDF]
Jiang H, Zhan S, Ching WK, Chen L.
europepmc +1 more source
SO2 Transfer Enabled by an Easy‐to‐Handle Ionic Liquid
Best of both worlds: The ionic liquid [NEt3Me][Cl(SO2)n] unites the atom economy and low cost of sulfur dioxide with the safety and applicability of common surrogates, streamlining SO2 transfer to access to 3‐sulfolenes, sulfonamides, and SuFEx reagents.
Johanna S. Sturm +11 more
wiley +1 more source
On the sum of signless Laplacian spectra of graphs
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj +1 more source

