Results 11 to 20 of about 17,262 (251)
On the spectral radius of VDB graph matrices
Vojnotehnički Glasnik, 2023 Introduction/purpose: Vertex-degree-based (VDB) graph matrices form a special class of matrices, corresponding to the currently much investigated vertex-degree-based (VDB) graph invariants. Some spectral properties of these matrices are investigated.
Ivan Gutman
doaj +1 more source
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu +3 more
doaj +1 more source
Geary’s c and Spectral Graph Theory: A Complement
Mathematics, 2023 Spatial autocorrelation, which describes the similarity between signals on adjacent vertices, is central to spatial science, and Geary’s c is one of the most-prominent numerical measures of it.
Hiroshi Yamada
doaj +1 more source
Spectral recognition of graphs [PDF]
Yugoslav Journal of Operations Research, 2012 At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra.
Cvetković Dragoš
doaj +1 more source
Spectrum and energy of the Sombor matrix [PDF]
Vojnotehnički Glasnik, 2021 Introduction/purpose: The Sombor matrix is a vertex-degree-based matrix associated with the Sombor index. The paper is concerned with the spectral properties of the Sombor matrix. Results: Equalities and inequalities for the eigenvalues of the Sombor
Ivan Gutman
doaj +1 more source
Spectral Theory of Infinite Quantum Graphs [PDF]
Annales Henri Poincaré, 2018 Dedicated to the memory of M. Z. Solomyak (16.05.1931 - 31.07.2016)
Pavel Exner +3 more
openaire +5 more sources
Doubling constants and spectral theory on graphs
Discrete Mathematics, 2023 We study the least doubling constant among all possible doubling measures defined on a (finite or infinite) graph $G$. We show that this constant can be estimated from below by $1+ r(A_G)$, where $r(A_G)$ is the spectral radius of the adjacency matrix of $G$, and study when both quantities coincide.
Estibalitz Durand-Cartagena +2 more
openaire +6 more sources
A Short Text Clustering Algorithm Based on Spectral Cut [PDF]
Jisuanji gongcheng, 2016 Short text has the characteristics of sparsity and high dimension,and the existing clustering algorithm for the large-scale short text has low accuracy and efficiency.Aiming at this problem,a novel clustering method based on spectral clustering theory ...
LI Xiaohong,XIE Meng,MA Huifang,HE Tingnian
doaj +1 more source
From Time–Frequency to Vertex–Frequency and Back
Mathematics, 2021 The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source
Eigenvalues of multipart matrices and their applications
The American Journal of Combinatorics, 2023 A square matrix is called a multipart matrix if all its diagonal entries are zero and all other entries in each column are constant. In this paper, we describe various interesting spectral properties of multipart matrices. We provide suitable bounds for
Ranjit Mehatari
doaj +1 more source