Extremal bipartite graphs with given parameters on the resistance-Harary index
Summary: Resistance distance is a concept developed from electronic networks. The calculation of resistance distance in various circuits has attracted the attention of many engineers. This report considers the resistance-based graph invariant, the Resistance-Harary index, which represents the sum of the reciprocal resistances of any vertex pair in the figure \(G\), denoted by \(R H(G)\). Vertex bipartiteness in a graph \(G\) is the minimum number of vertices removed that makes the graph \(G\) become a bipartite graph. In this study, we give the upper bound and lower bound of the \(R H\) index, and describe the corresponding extremal graphs in the bipartite graph of a given order. We also describe the graphs with maximum \(R H\) index in terms of graph parameters such as vertex bipartiteness, cut edges, and matching numbers.
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On the resistance-Harary index of unicyclic graphs
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- Maximum resistance-Harary index of cacti
- Resistance between two vertices of almost complete bipartite graphs
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Bounds on Harary index
- Distances and volumina for graphs
- Graph cyclicity, excess conductance, and resistance deficit
- Graph theory with applications
- scientific article; zbMATH DE number 1890092 (Why is no real title available?)
- On a new cyclicity measure of graphs -- the global cyclicity index
- On Harary index
- On the resistance-Harary index of unicyclic graphs
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
This page was built for publication: Extremal bipartite graphs with given parameters on the resistance-Harary index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337997)