Results 101 to 110 of about 13,572 (222)
Sharp decrease in the Laplacian matrix rank of phase-space graphs: a potential biomarker in epilepsy. [PDF]
Cogn Neurodyn, 2021 Yang Z, Fan D, Wang Q, Luan G.
europepmc +1 more source
Laplacian matrix and distance in trees
Kragujevac journal of mathematics, 2004 Laplacian matrix and distance in trees.
Vukičević, Damir, Gutman, Ivan
openaire +1 more source
On the Relation between the S-matrix and the Spectrum of the Interior Laplacian [PDF]
, 2009 А. Г. Рамм
openalex +1 more source
On spectrum and energies of enhanced power graphs
Mathematics OpenThe enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj +1 more source
Partitions of networks that are robust to vertex permutation dynamics
Special Matrices, 2015 Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem.
Froyland Gary, Kwok Eric
doaj +1 more source
Laplacians in polar matrix coordinates and radial fermionization in higher dimensions [PDF]
, 2011 Mthokozisi Masuku, J. P. Rodrigues
openalex +1 more source
Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems [PDF]
, 2017 Michael T. Schaub +3 more
openalex +1 more source
Multi-label feature selection based on dynamic graph Laplacian
Tongxin xuebao, 2020 In view of the problems that graph-based multi-label feature selection methods ignore the dynamic change of graph Laplacian matrix, as well as such methods employ logical-value labels to guide feature selection process and loses label information, a ...
Yonghao LI +3 more
doaj +2 more sources
The nullity of the net Laplacian matrix of a signed graph
American Journal of CombinatoricsThe net Laplacian matrix of a signed graph \(\Gamma = (G, \sigma)\), where \(G = (V(G),E(G))\) is an unsigned graph (referred to as the underlying graph) and \(\sigma: E(G) \rightarrow \{-1, +1\}\) is the sign function, is defined as \(L^{\pm}(\Gamma) = D^{\pm}(\Gamma) - A(\Gamma)\).
openaire +3 more sources
On the neighbourhood degree sum-based Laplacian energy of graphs
Kuwait Journal of ScienceA useful extension of the Laplacian matrix is proposed here and the corresponding modification of the Laplacian energy (LE) is presented. The neighbourhood degree sum-based Laplacian energy (LNE) is produced by means of the eigenvalues of the newly ...
doaj +1 more source