Minimum and maximum resistance status of unicyclic graphs
From MaRDI portal
Recommendations
Cites work
- Constructing new families of transmission irregular graphs
- Distance in graphs
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- scientific article; zbMATH DE number 5784227 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 90560 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3328106 (Why is no real title available?)
- scientific article; zbMATH DE number 3061533 (Why is no real title available?)
- Minimizing Effective Resistance of a Graph
- Minimum status of trees with given parameters
- Minimum statuses of connected graphs with fixed maximum degree and order
- Network descriptors based on betweenness centrality and transmission and their extremal values
- On the resistance matrix of a graph
- Pairs of a tree and a nontree graph with the same status sequence
- Proximity and remoteness in graphs: results and conjectures
- Proximity, remoteness and girth in graphs
- Proximity, remoteness and minimum degree
- Remoteness, proximity and few other distance invariants in graphs
- Some properties of a centroid of a free tree
- The median problem on \(k\)-partite graphs
Cited in
(4)
This page was built for publication: Minimum and maximum resistance status of unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866983)