Results 21 to 30 of about 150,247 (249)
Graphs Whose Aα -Spectral Radius Does Not Exceed 2
Discussiones Mathematicae Graph Theory, 2020 Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any real α ∈ [0, 1], we consider Aα (G) = αD(G) + (1 − α)A(G) as a graph matrix, whose largest eigenvalue is called the Aα -spectral radius of G.
Wang Jian Feng +3 more
doaj +1 more source
Laplacian versus adjacency matrix in quantum walk search [PDF]
Quantum Information Processing, 2015 A quantum particle evolving by Schrödinger’s equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace’s operator.
T. G. Wong +2 more
semanticscholar +1 more source
The Generalized Distance Spectrum of the Join of Graphs [PDF]
, 2020 Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +2 more sources
On the Aα-Spectral Radii of Cactus Graphs
Mathematics, 2020 Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm [PDF]
, 2006 In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in this paper, it
Aharonov +32 more
core +2 more sources
Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications
Discussiones Mathematicae Graph Theory, 2020 Given a graph G, its adjacency matrix A(G) and its diagonal matrix of vertex degrees D(G), consider the matrix Aα (G) = αD(G) + (1 − α)A(G), where α ∈ [0, 1).
Cardoso Domingos M. +2 more
doaj +1 more source
Complex spherical codes with three inner products [PDF]
, 2018 Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an ...
Nozaki, Hiroshi, Suda, Sho
core +3 more sources
New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix [PDF]
Electronic Journal of Combinatorics, 2012 The purpose of this article is to improve existing lower bounds on the chromatic number chi. Let mu_1,...,mu_n be the eigenvalues of the adjacency matrix sorted in non-increasing order. First, we prove the lower bound chi >= 1 + max_m {sum_{i=1}^m mu_i /
P. Wocjan, C. Elphick
semanticscholar +1 more source
Synchronization in Networks of Hindmarsh-Rose Neurons [PDF]
, 2008 Synchronization is deemed to play an important role in information processing in many neuronal systems. In this work, using a well known technique due to Pecora and Carroll, we investigate the existence of a synchronous state and the bifurcation diagram ...
Biey, Mario +3 more
core +1 more source
Hermitian Adjacency Matrices of Mixed Graphs [PDF]
European Journal of Pure and Applied Mathematics, 2021 The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed ...
Mohammad Abudayah, O. Alomari, T. Sander
semanticscholar +1 more source