Dumbbell graphs with extremal (reverse) cover cost
DOI10.1007/s40840-022-01433-7zbMath1504.05064OpenAlexW4312057603MaRDI QIDQ2107445
Shujing Wang, Yumiao Shi, Xueyao Gui, Ze-min Jin
Publication date: 1 December 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-022-01433-7
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Random walks on graphs (05C81) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
- On the Ihara zeta function and resistance distance-based indices
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Random walks and the effective resistance of networks
- Resistance distance and the normalized Laplacian spectrum
- Bounds on expected hitting times for a random walk on a connected graph
- The hitting and cover times of random walks on finite graphs using local degree information
- Expected hitting times for a random walk on a connected graph
- The electrical resistance of a graph captures its commute and cover times
- The expected hitting times for graphs with cutpoints.
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
- On the (reverse) cover cost of trees with some given parameters
- Bicyclic graphs with extremal cover cost
- Spanning trees and random walks on weighted graphs
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index
- Decomposing hitting times of walks on graphs into simpler ones
- An explicit formula of hitting times for random walks on graphs
- Degree Kirchhoff Index of Bicyclic Graphs
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
- The Hitting Time of Multiple Random Walks
- Uniqueness of electrical currents in a network of finite total resistance
- Distance in graphs
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times
- ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
- Bicyclic graphs with maximum degree resistance distance
- Graphs and matrices
This page was built for publication: Dumbbell graphs with extremal (reverse) cover cost
