The generalized distance spectrum of a graph and applications
From MaRDI portal
Publication:5038134
DOI10.1080/03081087.2020.1803187zbMath1497.05145arXiv1708.02294OpenAlexW3079095540MaRDI QIDQ5038134
Publication date: 29 September 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02294
Computational methods in Markov chains (60J22) Population dynamics (general) (92D25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (4)
On spectral radius of the generalized distance matrix of a graph ⋮ Exploiting the higher-order statistics of random-coefficient pure states for quantum information processing ⋮ On the distance spectra ofm-generationn-prism graph ⋮ Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance spectra of graphs
- Distance magic Cartesian products of graphs
- A short note on a short remark of Graham and Lovász
- Distance spectral radius of graphs with \(r\) pendent vertices
- Spectra of graphs
- Combinatorial models of creation-annihilation
- The distance spectrum and energy of the compositions of regular graphs
- Mixing time bounds via the spectral profile
- A conjecture of Biggs concerning the resistance of a distance-regular graph
- Distance-regular graphs and the \(q\)-tetrahedron algebra
- Distance degree regular graphs
- Approximate counting, uniform generation and rapidly mixing Markov chains
- On distance-regularity in graphs
- On the distance matrix of a tree
- Alternatives to Lotka-Volterra competition: Models of intermediate complexity
- Distance matrix polynomials of trees
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Spectral characterizations of some distance-regular graphs
- Once edge-reinforced random walk on a tree
- Biological evolution model with conditional mutation rates
- Generalized quasispecies model on finite metric spaces: isometry groups and spectral properties of evolutionary matrices
- Distance regularity of compositions of graphs.
- On distance matrices and Laplacians
- Addressing the Petersen graph
- On electric resistances for distance-regular graphs
- Distance regularity in direct-product graphs
- Addressing graph products and distance-regular graphs
- Distance spectra of graphs: a survey
- On the distance spectrum of distance regular graphs
- Senile reinforced random walks
- Communication constraints in the average consensus problem
- A characterization of bipartite distance-regular graphs
- The power of choice in random walks: An empirical study
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Evolving sets, mixing and heat kernel bounds
- An orthogonal basis for functions over a slice of the Boolean hypercube
- On the distance spectrum of graphs
- On the mixing time and spectral gap for birth and death chains
- A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
- Distance spectrum of graph compositions
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Mathematical Aspects of Mixing Times in Markov Chains
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Markov Chains
- Evolutionary Games and Population Dynamics
- Fastest Mixing Markov Chain on a Graph
- A more rapidly mixing Markov chain for graph colorings
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs
- Asymptotics of search strategies over a sensor network
- On the Laplacian spectra of product graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: The generalized distance spectrum of a graph and applications
