Dumbbell graphs with extremal (reverse) cover cost
DOI10.1007/S40840-022-01433-7zbMATH Open1504.05064OpenAlexW4312057603MaRDI QIDQ2107445FDOQ2107445
Authors: Yumiao Shi, Shujing Wang, Xueyao Gui, Zemin 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
Recommendations
- Bicyclic graphs with extremal cover cost
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- 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
- scientific article; zbMATH DE number 1788255
- On the cover time of dense graphs
- Reoptimization of Weighted Graph and Covering Problems
- scientific article; zbMATH DE number 3908459
- Publication:4484774
- Covering a graph with densest subgraphs
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Random walks on graphs (05C81) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Spanning trees and random walks on weighted graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
- Title not available (Why is that?)
- Resistance distance and the normalized Laplacian spectrum
- Distance in graphs
- Graphs and matrices
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
- Title not available (Why is that?)
- Random walks and the effective resistance of networks
- Title not available (Why is that?)
- On the Ihara zeta function and resistance distance-based indices
- Title not available (Why is that?)
- The electrical resistance of a graph captures its commute and cover times
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- The hitting and cover times of random walks on finite graphs using local degree information
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- Uniqueness of electrical currents in a network of finite total resistance
- The expected hitting times for graphs with cutpoints.
- Bicyclic graphs with maximum degree resistance distance
- Bounds on expected hitting times for a random walk on a connected graph
- The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- Degree Kirchhoff Index of Bicyclic Graphs
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- On the (reverse) cover cost of trees with some given parameters
- An explicit formula of hitting times for random walks on graphs
- Expected hitting times for a random walk on a connected graph
- The Hitting Time of Multiple Random Walks
- Decomposing hitting times of walks on graphs into simpler ones
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times
- Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
- Bicyclic graphs with extremal cover cost
Cited In (1)
This page was built for publication: Dumbbell graphs with extremal (reverse) cover cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107445)
