On the weighted reverse cover cost of trees and unicyclic graphs with given diameter

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On a conjecture concerning spanning tree invariants and loop systems
On the degree Kirchhoff index of unicyclic graphs
Resistance distance and the normalized Laplacian spectrum
Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
Further results on the expected hitting time, the cover cost and the related invariants of graphs
Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
The hitting times of random walks on bicyclic graphs
Dumbbell graphs with extremal (reverse) cover cost
On the (reverse) cover cost of trees with some given parameters
Bicyclic graphs with extremal cover cost
Extremal cover cost and reverse cover cost of trees with given segment sequence
Expected hitting times for random walks on the \(k\)-triangle graph and their applications
On the sum of all distances in bipartite graphs
An explicit formula of hitting times for random walks on 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
Hitting times for random walks on subdivision and triangulation graphs
Chung-Yau Invariants and Graphs with Symmetric Hitting Times
Extremal hitting times of trees with some given parameters
The hitting time of random walk on unicyclic graphs
Wiener index of trees: Theory and applications

This page was built for publication: On the weighted reverse cover cost of trees and unicyclic graphs with given diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585505)