Results 41 to 50 of about 96,121 (306)
The Local Spectra of Line Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 The local spectrum of a graph G = (V, E), constituted by the standard eigenvalues of G and their local multiplicities, plays a similar role as the global spectrum when the graph is “seen” from a given vertex. Thus, for each vertex i ∈ V , the i-local multiplicities of all the eigenvalues add up to 1; whereas the multiplicity of each eigenvalue λl ∈ ev ...
Fiol Mora, Miquel Àngel +1 more
openaire +2 more sources
Reproducibility of functional connectivity and graph measures based on the Phase Lag Index (PLI) and weighted Phase Lag Index (wPLI) derived from high resolution EEG [PDF]
, 2014 Functional connectivity (FC) and graph measures provide powerful means to analyze complex networks. The current study determines the inter-subject-variability using the coefficient of variation (CoV) and long-term test-retest-reliability (TRT) using the ...
Florian Hatz +23 more
core +1 more source
On Laplacian-energy-like invariant and incidence energy [PDF]
International Journal of Group Theory, 2015 For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj
An inequality on graph spectra
Applied Mathematics Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lihua Feng, Yunqing Xu
openaire +1 more source
Discrete Mathematics, 2009 An \(n\)-fold periodic locally finite graph in the Euclidean \(n\)-space may be considered the parent of an infinite class of \(n\)-dimensional toroidal finite graphs. An elementary method is developed that allows the characteristic polynomials of these graphs to be factored in a uniform manner, into smaller polynomials, all of the same size.
Peter E. John, Horst Sachs
openaire +2 more sources
Weisfeiler-Leman and Graph Spectra
, 2023 Error in Theorem 1.4 ...
Gaurav Rattan, Tim Seppelt
openaire +2 more sources
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source
The Laplacian spectrum of neural networks
Frontiers in Computational Neuroscience, 2014 The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks.
Siemon ede Lange +2 more
doaj +1 more source
European Journal of Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gerard J. Chang +2 more
openaire +2 more sources
Spectral properties of the commuting graphs of certain groups
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +2 more sources