Extremal Bipartite Graphs with Given Parameters on the Resistance–Harary Index

: 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 ﬁgure G , denoted by RH ( 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 RH index, and describe the corresponding extremal graphs in the bipartite graph of a given order. We also describe the graphs with maximum RH index in terms of graph parameters such as vertex bipartiteness, cut edges, and matching numbers.


Introduction
There are graph invariants that describe certain properties of a graph, which we call topological indices. Various topological indices are proposed and researched by both theoretical chemists and mathematicians. Topological index is mainly used to study the quantitative relationship between structure and performance and between structure and activity. It would be helpful for describing partially biological and chemical properties. Some of them have been proved to be successful [1]. Recently, finding the extreme value for the topological indices, as well as the related problem of characterizing the extremal graphs, attracted the attention of many researchers, and many results were obtained.
Among these topological indices, one of most widely known topological description is the Wiener index, which was proposed in 1947 and represents the sum of the distances of all pairs of vertices in the graph, i.e., W(G) = Recently, graph invariants based on resistance distance have attracted the attention of theorists, such as the Kirchhoff index. The resistance distance is what Klein and Randić [8] came up with as a function of the distance of the graph. The resistance distance between two vertices u and v of G, denoted by r G (u, v), represents the effective resistance of two elements u and v in a circuit, and each edge in G means the cell resistance.
Similar to the distance in the path graph, the resistance distance is also closely related to the structure of the graph, and not only has good mathematics and physics characteristics [9,10], but also has widespread chemistry applications.
The Kirchhoff index is one of the most studied topological indices, which is defined as With the continuous development and improvement of electrical network theory, D.J. Klein and O. Ivanciue [11] investigated the global cyclictiy index C(G), defined as ], Y. Yang [12] obtained some results on global cyclicity index. Inspired by the Harary index, S. Chen et al. [13] modify the global cyclicity index and put forward the Resistance-Harary index, described as In [14], the structure of the graph with maximum RH value is described among the connected graph with given order and cut edges. All graphs considered here are connected and simple. Let G be a graph with vertex set V(G) and edge set E(G), and the degree of each vertex v is expressed as d G (v), which means the number of neighbors of v in G. d G (u, v) is the distance between u and v in G, the longest distance between any two vertices in the graph is called the diameter.
As usual, let C n , S n and P n be a cycle, a star, and a path with n vertices, respectively. G − uv represents the subgraph obtained by deleting an edge uv from graph G. Similarly, G + uv represents the graph obtained by adding an edge uv to graph G. Let U and W be all the vertex sets of G. Where W ⊆ U, then U \ W represents the complement of W in U. The pendant vertex of G refers to the vertex of graph G with degree 1. The pendant edge is the edge adjacent to the pendant vertex.
A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets X and Y, such that every edge connects a vertex in X to one in Y. Vertex sets X and Y are usually called the parts of the graph. If a graph G is a bipartite graph, and all vertices in X are connected to all vertices in Y, then G is a completed bipartite graph.
If the number of vertices in each part of the completed bipartite is m and n, respectively, denoted it by K m,n . The cut vertex (edge) will increase the number of branches of the graph if it is removed. Other terms not defined here are referred to [15].
A matching M in graph G is a set of non-adjacent edges, that is, no two edges share a common vertex. A maximum matching (also known as maximum-cardinality matching) is a matching that contains the largest possible number of edges. There may be many maximum matchings. The matching number of a graph G is the size of a maximum matching.
Inspired by the above results, it is natural to consider these extremal problems from the class of general connected graphs to the bipartite graphs. Our aim in this article is to study the extremal bipartite graphs with given parameters on Resistance-Harary index. First, we give the upper bound and lower bound of RH index, and describe the corresponding extremal graphs in the bipartite graph of a given order. We also describe the graphs with maximum RH index in terms of graph parameters such as vertex bipartiteness v b , (where 1 ≤ v b ≤ n − 2), cut edges, and matching numbers.

General Connected Bipartite Graphs
In this section, we give the upper bound and lower bound of RH index, and describe the corresponding extremal graphs in the bipartite graph of a given order. In the simple connected acyclic graph, the Resistance distance and distance from the two points in the graph are equal, that is, the Resistance-Harary index and the Harary index are the same in the acyclic graph. There is a formula for this scenario: However, when the connected graph contains cycles, the resistance distance is different from the general distance. Our calculation is based on electrical network theory, given a fixed resistor on each edge, the shortest distance between two vertices represents the effective resistance of the corresponding two components in the circuit. Let C k = u 1 u 2 . . . u k u 1 be the cycle on k vertices, where k ≥ 3. By Ohm's law, any two components in a circuit u s , u t ∈ V(C k ) with s < t, we have then, we have We start with some useful lemmas.

Lemma 1 ([8]
). w is the cut vertex of graph G, and let u and v be two vertices of different components of G − w. There must be r G (u, v) = r G (u, w) + r G (w, v).

Lemma 2 ([14]
). Let G be a graph that is not complete. Add an edge from G and we get the graph G * . So there is RH(G * ) > RH(G). That is to say, RH(G) increases with addition of edges. Corollary 1. G is a connected graph with n vertices, and H is a connected spanning subgraph of G. Then RH(H) ≤ RH(G), the equal sign is true when G ∼ = H.

Lemma 3 ([13]
). Let T be a tree on n vertices different from P n and S n . Then is the graph with maximum RH index among all connected bipartite graphs of order n.
Proof. Choose G 0 as the graph such that its Resistance-Harary index is as large as possible, let (X, Y) be its two divisions, where |X| + |Y| = n. We first prove the following two claims. Claim 1. G 0 is a complete bipartite graph. Suppose to the contrary that G 0 = (X, Y) is a graph that is not complete. Thus we can add one edge from u ∈ X to v ∈ Y to form a new graph G 0 + uv. It is obvious that G 0 + uv is still a bipartite graph. By Lemma 2, we know that RH(G 0 + uv) > RH(G 0 ), which contradicts the maximality of G 0 .
From Claim 1, we denote G 0 as K s,t . In a complete connected bipartite graph K s,t , Klein [16] obtain that the resistance distance between vertices from X and Y, respectively, is s+t−1 st . The resistance distance between any two vertices in X and in Y is 2 t and 2 s , respectively, hence, by Lemma 1 and the definition of RH index, we can get that Then, So RH(K s,t ) obtain the extremal value if and only if K s,t ∼ = K n 2 n 2 . This completes the proof.

Theorem 2.
For any bipartite graph G of order n, we have .
Proof. By Lemma 3 and Corollary 1, we can deduce that P n has minimal RH index in the bipartite graphs of order n. By Theorem 1, one can see that K n 2 , n 2 has the maximum Resistance-Harary index. By direct calculation, we have This completes the proof.

Bipartite Graphs Given Number of Matchings
In this section, we are going to characterize the extremal bipartite graphs of order n with given matching number q for the Resistance-Harary index.

Lemma 4.
The function for f (x) = x 2 q 2 x+q−1 for q > 1 and x > q is strictly increasing.
Proof. Now, let us compute the derivative of this function This completes the proof.
Theorem 3. Graph K q,n−q has the largest RH in the bipartite graphs of order n given matching number q.
Proof. We assume that G is a bipartite graph of a given matching number q, and (U, W) is its vertex partition, and G has the largest RH index. Obviously, q ≤ n 2 , if q = n 2 , by Lemma 2 and Theorem 1, the extremal graph happens to be isomorphic to K n 2 , n 2 , as expected. We are going to prove that, q < n 2 , naturally, we make |W| ≥ |U| and take |M| = q as the maximal matching of G, by Lemma 2, the value of the Resistance-Harary index is increasing when we increase the number of edges. So if |U| = q, the extremal graph G ∼ = K q,n−q . Next, we consider |U| > q. Let U M , W M be the vertex subset sets in U, W saturated with M, respectively. Then, |U M | = |W M | = q. By the maximality of M, we infer that there are no edges set between U \ U M and W\W M . Add as many edges between the vertices of U M and W M , U M and W \ W M , U \ U M and W M as we can from G, we get the result graph G . Note that W\W M = ∅ and U \ U M = ∅ and G has at least q + 1 matching number. So, G = G and by Lemma 2, we have RH(G ) > RH(G). We get another bipartite graph G by separating two vertices sets of U \ U M and W M and associating two sets of U \ U M and U M in graph G . Obviously, G is isomorphic to the complete bipartite graph K q,n−q , which has the matching number q. Next, we will prove that RH(G ) > RH(G ).
For x ∈ W \ W M and w ∈ U \ U M , the resistance distance between two vertices x and w is Then, we have This gives ).

Graphs with Given Vertex Bipartiteness
In this section, we described the extremal graph with a given vertex bipartiteness for Resistance-Harary index. Let G 1 and G 2 be the graphs where any two vertices do not intersect. We obtain the joint graph of G 1 and G 2 through the correlation of every vertex of graph G 1 with every vertex of graph G 2 , denoted it by G 1 ∨ G 2 . The vertex bipartiteness of a graph G is the minimum number of vertices removed makes the graph G a bipartite graph, which is denoted by v b (G), see [17]. Let G n,δ be the set of the graphs with n vertices and v b (G) ≤ δ, where δ is the positive integer that does not exceed n − 2.

Lemma 5.
Let G be the graph in G n,δ . There is a pair of positive integers s and t that satisfies s + t = n − δ, we have RH(G) ≤ RH(G * ) for all graphs G ∈ G n,δ , and the equality holds if and only if G * ∼ = K δ ∨ K s,t .
Proof. By Lemma 2, we know that RH is a topological index whose value increases with the number of edges. Let G * ∈ G n,δ be the graph with the largest RH index value, that is to say, RH(G * ) ≥ RH(G) for all graphs G ∈ G n,δ . Since G * ∈ G n,δ , there are v 1 , v 2 , · · · , v k ∈ V(G * ) (k ≤ δ) such that G * − {v 1 , v 2 , · · · , v k } is a bipartite graph, let (X, Y) be its vertex sets, and |X| = s and |Y| = t. Thus, s + t = n − k. If G * − {v 1 , v 2 , · · · , v k } = K s,t , then there exists two vertices u, v that are not adjacent and u ∈ X, v ∈ Y. We get another graph G * + e ∈ G n,δ by getting a new edge e = uv, then RH(G * + e) > RH(G * ), and we get the contradiction, so G * − {v 1 , v 2 , · · · , v k } = K s,t . In addition, if there are two vertices that are not adjacent to each other and u, v ∈ {v 1 , v 2 , · · · , v k }, then we get a new graph G * + uv ∈ G n,δ , by adding a new edge uv into G * , then RH(G * + uv) > RH(G * ), again, a contradiction. This suggests that the subgraph induced by {v 1 , v 2 , · · · , v k } is K k , so G * ∼ = K k ∨ K s,t . At last, we prove that k = δ. To the contrary, assume that |X| = s ≥ 2 or |Y| = t ≥ 2. Naturally, we set t ≥ 2. Pick a vertex v from Y, and add the edges vv i to K k ∨ K s,t , where v i ∈ {v 1 , v 2 , · · · , v k }, the resulting graph is K k+1 ∨ K s,t−1 ∈ G n,δ , and it has t − 1 ≥ 1 edges more than graph G * , implying that RH(K k+1 ∨ K s,t−1 ) > RH(K k ∨ K s,t ) = RH(G * ), which is a contradiction. Therefore, k = δ and G * ∼ = K δ ∨ K s,t . Complete the proof of the theorem. Lemma 6. Let G ∼ = K δ ∨ K s,t and G ∼ = K δ ∨ K s+1,t−1 . If s ≤ t − 2, then RH(G ) > RH(G).
Next, we describe the graphs with extremal Resistance-Harary index values in the graph with given vertex bipartiteness. The following conclusion is easy to deduce by applying Lemmas 2, 5, and 6. Theorem 4. Let G be the graph of G n,δ . Where 1 ≤ δ ≤ n − 2, then (a) If n − m is even, then RH(

Bipartite Graph with a Given Cut Edges
In this section, we determine bipartite graph given cut edges with maximum Resistance-Harary index. Lemma 7. G 1 and G 2 are connected graphs whose vertices do not intersect, assume that u ∈ G 1 and v ∈ G 2 . We connect u and v to get G, and if we identified two vertices u with v in G, we get graph G . Let the new vertex be w, which is adjacent to a pendant vertex w 0 (see Figure 2). Then RH(G ) > RH(G).

Proof. By Lemma 1 and the definition of RH index, we have
.
Then RH(G ) > RH(G). This completes the proof. Figure 2. Graphs G and G in Lemma 7.
By Lemma 9, it is straightforward to see that Corollary 2. Let G k n be the bipartite graphs of order n with k cut edges obtained by identifying the center of K k+1 order star graph and one vertex of a complete graph with n − k vertices. For G ∈ G k n , we have , and equality is attained if and only if G ∼ = K k Let B k n be the set of connected bipartite graphs with n order and k cut edges. For k = 0, from Theorem 1, then the graph with maximum RH index is isomorphic to graph K n 2 n 2 . For k = n − 1, the bipartite graph is a tree, so the Resistance distance and distance between the vertices in the tree are equal, that is, the Resistance-Harary index in the tree was the same as the Harary index. So the maximum Resistance-Harary index is obtained uniquely at S n .
Next, we focus on the case 1 ≤ k ≤ n − 4.

Theorem 5.
In all connected bipartite graphs with n order and k cut edges, where 1 ≤ k ≤ n − 4, the maximum Resistance-Harary index is founded at K k n−k 2 Proof. Let G 0 be the graph having the maximum RH index value in B k n and E 1 be the set of cut edges of G 0 . Where G 0 and G 0 − E 1 are bipartite graphs, then by Lemma 2, we can know that each component of G 0 − E 1 is a complete bipartite graph. In addition, by Lemma 7, every edge of E 1 must be pendant edges. Hence, G 0 must be the graph constructed from K m,n−m−k by hanging k pendant edges. Finally, by Lemma 8, all these pendant edges in G 0 must be attached to one common vertex. That is to say, G 0 must be one of the graph G k n , furthermore, by Corollary 2, we get that G 0 ∼ = K k n−k 2 n−k 2 . This completes the proof.

Discussion
Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena. In chemical graph theory, vertices represent atoms and edges represent the connections between atoms. The topological exponent of a graph is a function defined on a (molecular) graph regardless of the labeling of its vertices. The Resistance-Harary index is a topological descriptor that has been correlated with the relationship between structure and performance and between structure and activity molecular descriptors. To correlate with electrical network theory and real analysis, the Resistance-Harary index has much better predictive power than that of the global cyclicity index.

Conclusions
In this paper, we first present a structural of the extremal graphs for Resistance-Harary index over all bipartite graphs with n vertices, then characterize the extremal graphs given vertex bipartiteness on the RH index. Moreover, we optimize the extremal structure of bipartite graphs with given cut edges and bipartite graphs with given matching numbers. Along this line, some other interesting extremal problems on bipartite graphs with given parameters are valuable to be considered. In the future we can also characterize extremal bipartite graphs with fixed diameter on the Resistance-Harary index.
Author Contributions: H.W. is responsible for providing methods, proofs and analysis processes. P.Y. is responsible for correcting grammatical errors, calculating and checking, and writing the first draft, H.W. wrote the final draft.