Results 301 to 310 of about 323,816 (328)
Some of the next articles are maybe not open access.
Robustness of random graphs based on graph spectra
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2012It has been recently proposed that the robustness of complex networks can be efficiently characterized through the natural connectivity, a spectral property of the graph which corresponds to the average Estrada index. The natural connectivity corresponds to an average eigenvalue calculated from the graph spectrum and can also be interpreted as the ...
Wu, Jun +3 more
openaire +3 more sources
Linear and Multilinear Algebra, 2020
A Deza graph with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where b≥a.
S. Akbari +5 more
openaire +1 more source
A Deza graph with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where b≥a.
S. Akbari +5 more
openaire +1 more source
Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Cvetković, Dragoš, Rowlinson, Peter
openaire +1 more source
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Cvetković, Dragoš, Rowlinson, Peter
openaire +1 more source
Graph Classification Based on Optimizing Graph Spectra
2010Kernel methods such as the SVM are becoming increasingly popular due to their high performance in graph classification. In this paper, we propose a novel graph kernel, called SPEC, based on graph spectra and the Interlace Theorem, as well as an algorithm, called OPTSPEC, to optimize the SPEC kernel used in an SVM for graph classification.
Nguyen Duy Vinh +2 more
openaire +1 more source
2017
Let \(G=(V,E)\) be a finite graph on \(n=|V|\) vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of \(n\times n\) matrix, say A.
openaire +1 more source
Let \(G=(V,E)\) be a finite graph on \(n=|V|\) vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of \(n\times n\) matrix, say A.
openaire +1 more source
On Normalized Laplacian Spectra of the Weakly Zero-Divisor Graph of the Ring ℤn
Mathematics, 2023Nazim +2 more
exaly
Zoology of non-Hermitian spectra and their graph topology
Physical Review B, 2023Tommy Tai, Ching Hua Lee
exaly