Results 251 to 260 of about 1,624,240 (288)

Flat-Band Localization in Electrical Circuits from One to Three Dimensions. [PDF]

Materials (Basel)
Shao K, Liu F.
europepmc   +1 more source

Mapping Higher-Order Topology in OCD Brain Networks with Hodge Laplacian

Ruan H, Chung MK, Bruin WB, Džinalija N, Abe Y, Alonso P, Anticevic A, Balachander S, Batistuzzo MC, Benedetti F, Bertolín S, Brem S, Cho Y, Colombo F, Couto B, Eng GK, Ferreira S, Feusner JD, Grazioplene RG, Gruner P, Hagen K, Hansen B, Hirano Y, Hoexter MQ, Ipser J, Jaspers-Fayer F, Kim M, Kwon JS, Lazaro L, Li CR, Lochner C, Marsh R, Martínez-Zalacaín I, Menchón JM, Moreira PS, Morgado P, Muñoz E, Nakagawa A, Narayanaswamy JC, Nurmi EL, O’Neill J, Pariente JC, Piacentini JC, Picó-Pérez M, Piras F, Piras F, Pittenger C, Reddy JYC, Rodriguez-Manrique D, Sakai Y, Sato JR, Shimizu E, Shivakumar V, Simpson HB, Soriano-Mas C, Sousa N, Stern ER, Stewart E, Szeszko PR, Thomopoulos SI, Thorsen AL, Vai B, van der Straten A, van der Werf YD, van Leeuwen W, van Marle H, van Wingen G, Vecchio D, Venkatasubramanian G, Vriend C, Walitza S, Wang Z, Yoshida T, Yun J, Zhao Q, ENIGMA OCD Working Group, Thompson PM, Stein DJ, van den Heuvel OA, Koch K.   +79 more
europepmc   +1 more source

The perturbed laplacian matrix of a graph

Linear and Multilinear Algebra, 2001
For a graph G, we define its perturbed Laplacian matrix as D−A(G) where A(G) is the adjacency matrix of G and D is an arbitrary diagonal matrix. Both the Laplacian matrix and the negative of the adjacency matrix are special instances of the perturbed Laplacian.
Sukanta Pati, R B Bapat
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph

Lecture Notes in Computer Science, 2017
In a simple graph, Laplacian matrix and signless Laplacian matrix are derived from both adjacency matrix and degree matrix. Although, determinant of Laplacian matrix is always zero, yet we express it using only the adjacency matrix and square of its adjacency matrix.
Olayiwola Babarinsa, Hailiza Kamarulhaili   +1 more
exaly   +2 more sources

Hermitian normalized Laplacian matrix for directed networks

Information Sciences, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthias Dehmer, Jodlbauer Herbert, Frank Emmert-Streib   +2 more
exaly   +4 more sources

Hermitian Laplacian matrix and positive of mixed graphs

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guihai Yu
exaly   +4 more sources

The Laplacian matrix in chemistry

Journal of Chemical Information and Computer Sciences, 1994
The Laplacian matrix, its spectrum, and its polynomial are discussed. An algorithm for computing the number of spanning trees of a polycyclic graph, based on the corresponding Laplacian spectrum, is outlined. Also, a technique using the Le Verrier-Faddeev-Frame method for computing the Laplacian polynomial of a graph is detailed.
Nenad Trinajstic, Darko Babic, Sonja Nikolic, Dejan Plavsic, Dragan Amic, Zlatko Mihalic   +5 more
openaire   +4 more sources

Orthogonal Eigenvector Matrix of the Laplacian

2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), 2015
The orthogonal eigenvector matrix Z of the Laplacian matrix of a graph with N nodes is studied rather than its companion X of the adjacency matrix, because for the Laplacian matrix, the eigenvector matrix Z corresponds to the adjacency companion X of a regular graph, whose properties are easier.
Xiangrong Wang 0002, Piet Van Mieghem
openaire   +2 more sources

On the eigenvalues of Laplacian ABC -matrix of graphs

Quaestiones Mathematicae, 2023
No ...
Bilal Ahmad Rather, Hilal A. Ganie, Xueliang Li   +2 more
openaire   +2 more sources

On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum

Journal of Graph Theory, 2012
AbstractIn a paper Fallat et al. (J Graph Theory 50 (2005), 162–174) consider the question of the existence of simple graphs on n vertices whose Laplacian matrix has an integral spectrum consisting of simple eigenvalues only in the range , 0 always being, automatically, one of the eigenvalues.
Assaf Goldberger, Michael Neumann
openaire   +3 more sources