Bounds on Kemeny's constant of trees with a prescribed matching number
From MaRDI portal
Publication:2700621
DOI10.1016/j.dam.2023.03.017OpenAlexW4360966796MaRDI QIDQ2700621
Publication date: 27 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.017
Theory of matrix inversion and generalized inverses (15A09) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Why the Kemeny time is a constant
- The Kemeny constant for finite homogeneous ergodic Markov chains
- Spectra of graphs
- Bounds on the largest eigenvalues of trees with a given size of matching
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- The normalized Laplacian spectrum of subdivisions of a graph
- Directed forests and the constancy of Kemeny's constant
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
- Kemeny's constant for countable Markov chains
- Kemeny's constant for several families of graphs and real-world networks
- Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- On the normalized Laplacian spectral radius, Laplacian incidence energy and Kemeny's constant
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications
- Kemeny's constant and the effective graph resistance
- Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
- Kemeny's Constant and the Random Surfer
- Expected hitting times for random walks on quadrilateral graphs and their applications
This page was built for publication: Bounds on Kemeny's constant of trees with a prescribed matching number
