Results 111 to 120 of about 18,314 (299)
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
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Ganie HA, Shang Y.
europepmc +1 more source
Matrix tree theorem for the net Laplacian matrix of a signed graph [PDF]
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 ...
Mallik, Sudipta
core +1 more source
ABSTRACT Cell‐in‐cell (CIC) structures are among the most intriguing cellular phenomena occasionally observed in human cancer specimens. Once regarded as incidental findings, accumulating evidence has linked specific CIC subtypes, particularly entosis, to tumor progression and patient prognosis.
Maria V. Leyba‐Mesa +4 more
wiley +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
Abstract Objective Surgical decision‐making in temporal lobe epilepsy (TLE) faces a critical challenge in determining whether the hippocampus can be safely spared during anterior temporal resection, particularly when surgery involves the language‐dominant hemisphere.
Guhan Seshadri NP +6 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
On distance signless Laplacian spectrum and energy of graphs
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
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
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

