Abstract
The harmonic index of a graph G is defined as the sum of the weights \(\frac{2}{\deg _G(u)+\deg _G(v)}\) of all edges uv of G, where \(\deg _G(u)\) denotes the degree of a vertex u in G. In this paper, we investigate the harmonic index of graphs based on operations related to the lexicographic product, subdivision graph, t-subdivision graph, vertex-semitotal graph, edge-semitotal graph and total graph.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
Throughout this paper, all graphs are finite, simple, undirected and connected. Let G be a graph with vertex set V(G) and edge set E(G). We will use \(P_n\) to denote the path of order n.
The inverse degree and first Zagreb index of a graph G are defined as \(r(G)= \sum _{u\in V(G)} \frac{1}{\deg _G(u)}\) and \(M_1(G)= \sum _{u\in V(G)} \deg _G^2(u)=\sum _{uv\in E(G)} \big (\deg _G(u) +\deg _G(v) \big )\), respectively [1, 7].
The lexicographic product \(G_1 [G_2]\) of two graphs \(G_1\) and \(G_2\) is a graph with vertex set \(V(G_1)\times V(G_2)\) in which two vertices \((u_1,v_1)\) and \((u_2,v_2)\) of \(G_1 [G_2]\) are adjacent if and only if \(\left[ u_1=u_2 ~{\text {and}} ~ v_1 v_2 \in E(G_2)\right]\) or \(\left[ u_1u_2\in E(G_1) ~{\text {and}}~ v_1,v_2 \in V(G_2)\right]\).
For a graph G, there are several related graphs such as line graph L(G), subdivision graph S(G), t-subdivision graph \(S_t(G)\), vertex-semitotal graph R(G), edge-semitotal graph Q(G) and total graph T(G), defined as follows [2, 6, 15]:
L(G) has as its vertices the edges of G; adjacency in L(G) is defined as adjacency for the corresponding edges of G.
S(G) is obtained from G by replacing each edge of G by a path of length 2.
\(S_t(G)\) is obtained from G by replacing each edge of G by a path of length \(t+1\). Obviously, \(S_1(G) = S(G)\).
R(G) is obtained from G by adding a new vertex corresponding to each edge of G and then joining each new vertex to the end vertices of the corresponding edge.
Q(G) is obtained from G by inserting a new vertex into each edge of G and then joining with edges those pairs of new vertices on adjacent edges of G.
T(G) has as its vertices, the edges and vertices of G; adjacency in T(G) is defined as adjacency or incidence for the corresponding elements of G.
Let \(F\in \{S,R,Q,T\}\). The F-product \(G_1[G_2]_F\) of two graphs \(G_1\) and \(G_2\) is a graph with vertex set \(\left( V(G_1)\cup E(G_1) \right) \times V(G_2)\) in which two vertices \((u_1,v_1)\) and \((u_2,v_2)\) of \(G_1[G_2]_F\) are adjacent if and only if \(\left[ u_1=u_2 \in V(G_1) ~{\text {and}} ~ v_1 v_2 \in E(G_2)\right]\) or \(\left[ u_1u_2\in E(F(G_1)) ~{\text {and}} ~\right.\) \(\left. v_1, v_2 \in V(G_2) \right]\) [12].
We refer to the vertices in \(V(G_1)\) and \(V(F(G_1)) -V(G_1)\) as black vertices and white vertices, respectively, where \(F\in \{S,R,Q,T\}\).
\(P_4 [P_2]_S\), \(P_4 [P_2]_R\), \(P_4 [P_2]_Q\) and \(P_4 [P_2]_T\) are shown in Fig. 1.
For a graph G, the Randić index R(G) is defined as \(R(G)=\sum _{uv\in E(G)} \left( \deg _G(u) \deg _G(v) \right) ^{-\frac{1}{2}}\) [11]. The sum-connectivity index \(\chi (G)\) and general sum-connectivity index \(\chi _{\alpha } (G)\) are closely related variants of Randić index, defined as \(\chi (G)=\sum _{uv\in E(G)} \left( \deg _G(u) + \deg _G(v) \right) ^{-\frac{1}{2}}\) and \(\chi _{\alpha }(G)=\sum _{uv\in E(G)} \left( \deg _G(u) + \deg _G(v) \right) ^\alpha\), where \(\alpha\) is a real number [19, 20]. It has been found that the (general) sum-connectivity index and Randić index correlate well among themselves and with the \(\pi\)-electronic energies of benzenoid hydrocarbons [4, 5].
In this paper, we consider the harmonic index, which is another variant of Randić index. For a graph G, the harmonic index H(G) is defined as \(H(G)=\sum _{uv\in E(G)} \frac{2}{\deg _G(u) +\deg _G(v)}\) [1]. In recent years, this vertex-degree-based topological index has been extensively studied. For example, Zhong [16] gave the minimum and maximum values of the harmonic index for simple connected graphs and trees and characterized the corresponding extremal graphs. Recently, Onagh investigated the harmonic index of product graphs, subdivision graphs, t-subdivision graphs, vertex-semitotal graphs, edge-semitotal graphs, total graphs and F-sum of graphs, where \(F\in \{S,S_t,R,Q,T\}\) [8,9,10]. More results on the harmonic index can be found in [3, 13, 14, 17, 18].
In this paper, we extend the definition of F-product to \(S_t\)-product of graphs and give an upper bound for the harmonic index of F-product of graphs, where \(F\in \{S,S_t,R,Q,T\}\).
The harmonic index for F-products of graphs
First, we give an upper bound for the harmonic index of \(G_1[G_2]_F\) in terms of \(H(S(G_1))\), \(H(G_2)\), \(r(G_1)\) and \(r(G_2)\), where \(F\in \{S,S_t\}\).
Theorem 2.1
Let \(G_1\) and \(G_2\) be two graphs. Then
where \(n_i=|V(G_i)|\) and \(m_i=|E(G_i)|\), \(i=1,2\).
Proof
Let \(\deg (u,v)=\deg _{G_1 [G_2]_S } (u,v)\) be the degree of a vertex (u, v) in \(G_1[G_2]_S\). By the definition of the harmonic index, we have
Then,
By Jensen’s inequality, for every \(u\in V(G_1)\) and \(v_1v_2 \in E(G_2)\), we have
with equality if and only if \(2n_2 \deg _{G_1}(u) = \deg _{G_2}(v_1) + \deg _{G_2}(v_2)\).
So,
Also,
Similarly, for every \(u_1\in V(G_1)\) and every \(v_1 \in V(G_2)\), we have
with equality if and only if \(n_2 \left( \deg _{G_1}(u_1) + 2 \right) = \deg _{G_2}(v_1)\).
Thus,
Therefore,
Moreover, equality holds in above inequality if and only if the inequalities (2.1) and (2.2) be equalities, i.e., \(G_1\) and \(G_2\) are \(k_1\)-regular and \(k_2\)-regular graphs, respectively, such that \(2 n_2 k_1=k_2+k_2\) and \(n_2(k_1+2)=k_2\), a contradiction. This completes the proof. \(\square\)
Example 2.2
For any \(n\ge 2\),
In the following, we extend the definition of F-product to \(S_t\)-product of graphs.
Definition 2.3
Let \(G_1\) and \(G_2\) be two graphs. The \(S_t\)-product \(G_1 [G_2]_{S_t}\) is a graph with vertex set \(V(S_t(G_1))\times V(G_2)\) in which two vertices \((u_1,v_1)\) and \((u_2,v_2)\) of \(G_1 [G_2] _{S_t}\) are adjacent if and only if \(\left[ u_1=u_2 \in V(G_1) ~{\text {and}} ~ v_1 v_2 \in E(G_2)\right]\) or \(\left[ u_1u_2\in E(S_t(G_1)) ~{\text {and}}~ v_1,v_2\right.\) \(\left. \in V(G_2)\right]\).
Similarly, we refer to the vertices in \(V(G_1)\) and \(V(S_t(G_1)) -V(G_1)\) as black vertices and white vertices, respectively.
\(P_4 [P_2]_{S_3}\) is shown in Fig. 2.
Theorem 2.4
Let \(G_1\) and \(G_2\) be two graphs. Then
where \(n_i=|V(G_i)|\) and \(m_i=|E(G_i)|\), \(i=1,2\).
Proof
Let \(\deg (u,v)=\deg _{G_1 [G_2]_{S_t}} (u,v)\) be the degree of a vertex (u, v) in \(G_1 [G_2]_{S_t}\). Then,
By the proof of Theorem 2.1, one can get
with equality \(2n_2 \deg _{G_1}(u)= \deg _{G_2}(v_1) + \deg _{G_2}(v_2)\) for all \(u\in V(G_1)\) and \(v_1 v_2 \in E(G_2)\).
Note that
According to the proof of Theorem 2.1, we have
with equality if and only if \(n_2 \left( \deg _{G_1}(u_1) +2 \right) =\deg _{G_2}(v_1)\) for all \(u_1\in V(G_1)\) and \(v_1 \in V(G_2)\).
Therefore,
One can see that equality in above inequality cannot occur. This completes the proof. \(\square\)
Example 2.5
For any \(n\ge 2\),
In the following, we give an upper bound for the harmonic index of \(G_1[G_2]_R\) in terms of \(H(R(G_1))\), \(H(G_1)\), \(H(G_2)\), \(r(G_1)\) and \(r(G_2)\).
Theorem 2.6
Let \(G_1\) and \(G_2\) be two graphs. Then
where \(n_i=|V(G_i)|\) and \(m_i=|E(G_i)|\), \(i=1,2\).
Proof
Let \(\deg (u,v)=\deg _{G_1[G_2]_R } (u,v)\) be the degree of a vertex (u, v) in \(G_1[G_2]_R\). Then,
Note that
Similar to the proof of Theorem 2.1, one can get
with equality \(4n_2 \deg _{G_1}(u)= \deg _{G_2}(v_1) + \deg _{G_2}(v_2)\) for all \(u\in V(G_1)\) and \(v_1 v_2 \in E(G_2)\).
Also,
Note that
By Jensen’s inequality, for every \(u_1u_2\in E(G_1)\) and \(v_1,v_2 \in V(G_2)\), we have
with equality if and only if \(2n_2 \left( \deg _{G_1 }(u_1 )+\deg _{G_1 }(u_2 ) \right) =\deg _{G_2} (v_1)=\deg _{G_2} (v_2)\).
So, \(\displaystyle \sum 2^{'} \le \frac{1}{18}n_2 H(G_1) +\frac{4}{9} m_1 n_2 r(G_2)\).
Finally,
By the similar argument as above, for every \(u_1 \in V(G_1 )\) and \(v_1 \in V(G_2 )\), we have
with equality if and only if \(2 n_2 \left( \deg _{G_1}(u_1) + 1 \right) = \deg _{G_2}(v_1)\).
Hence,
Therefore,
Furthermore, equality holds in above inequality if and only if the inequalities (2.3), (2.4) and (2.5) be equalities, i.e., \(G_1\) and \(G_2\) are \(k_1\)-regular and \(k_2\)-regular graphs, respectively, such that \(4n_2 k_1=k_2+k_2\), \(2n_2(k_1+k_1)=k_2\) and \(2n_2(k_1+1)=k_2\), a contradiction. This completes the proof. \(\square\)
Example 2.7
For any \(n\ge 3\),
Now, we give an upper bound for the harmonic index of \(G_1[G_2]_Q\) in terms of \(H(Q(G_1))\), \(H(L(G_1))\), \(H(G_2)\), \(M_1(G_1)\), \(r(G_1)\) and \(r(G_2)\).
Theorem 2.8
Let \(G_1\) and \(G_2\) be two graphs. Then
where \(n_i=|V(G_i)|\) and \(m_i=|E(G_i)|\), \(i=1,2\).
Proof
Let \(\deg (u,v)=\deg _{G_1[ G_2]_Q } (u,v)\) be the degree of a vertex (u, v) in \(G_1[G_2]_Q\). Then,
Note that
By the proof of Theorem 2.1, we have
with equality \(2n_2 \deg _{G_1}(u)= \deg _{G_2}(v_1) + \deg _{G_2}(v_2)\) for all \(u\in V(G_1)\) and \(v_1 v_2 \in E(G_2)\).
Also,
For every \(v\in V(G_2)\) and \(u_1u_2 \in E(Q(G_1))\) with \(u_1 \in V(G_1)\) and \(u_2 \in V(Q(G_1))-V(G_1)\), we have
with equality if and only if \(n_2 \left( \deg _{Q(G_1)}(u_1) + \deg _{Q(G_1)}(u_2) \right) = \deg _{G_2}(v_1)\).
Thus,
So,
Similarly, one can verify that
with equality if and only if \(\deg _{L(G_1)}(w) +\deg _{L(G_1)} (w') =4\) for all \(ww'\in E(L(G_1))\).
Therefore,
Moreover, equality holds in above inequality if and only if the inequalities (2.6), (2.7) and (2.8) be equalities, i.e., \(G_1\) and \(G_2\) are \(k_1\)-regular and \(k_2\)-regular graphs, respectively, such that \(2n_2k_1=k_2+k_2\), \(n_2\left( k_1 +2k_1 \right) =k_2\) and \((2k_1-2)+(2k_1-2)=4\), a contradiction. This completes the proof. \(\square\)
Example 2.9
For any \(n\ge 4\),
Finally, we give an upper bound for the harmonic index of \(G_1[G_2]_T\) in terms of \(H(T(G_1))\), \(H(L(G_1))\), \(H(G_1)\), \(H(G_2)\), \(M_1(G_1)\), \(r(G_1)\) and \(r(G_2)\).
Theorem 2.10
Let \(G_1\) and \(G_2\) be two graphs. Then
where \(n_i=|V(G_i)|\) and \(m_i=|E(G_i)|\), \(i=1,2\).
Proof
Let \(\deg (u,v)=\deg _{G_1 [G_2]_T} (u,v)\) be the degree of a vertex (u, v) in \(G_1 [ G_2]_T\). Then,
By the similar argument as proof of Theorems 2.6 and 2.8, we have
So,
Moreover, equality holds in above inequality if and only if \(G_1\) and \(G_2\) be \(k_1\)-regular and \(k_2\)-regular graphs, respectively, such that \(4n_2k_1=k_2+k_2\), \(2n_2\left( k_1+k_1\right) =k_2\), \(n_2\left( 2k_1 +2k_1 \right) =k_2\) and \((2k_1-2)+(2k_1-2)=4\), a contradiction. This completes the proof. \(\square\)
Example 2.11
For any \(n\ge 4\),
References
Fajtlowicz, S.: On conjectures of graffiti II. Congr. Numer. 60, 189–197 (1987)
Gutman, I., Furtula, B., Vukićević, Ž.K., Popivoda, G.: On Zagreb indices and coindices. MATCH Commun. Math. Comput. Chem. 74, 5–16 (2015)
Hu, Y., Zhou, X.: On the harmonic index of the unicyclic and bicyclic graphs. WSEAS Trans. Math. 12(6), 716–726 (2013)
Lučić, B., Nikolić, S., Trinajstić, N., Zhou, B., Turk, I.S.: Sum-connectivity index. In: Gutman, I., Furtula, B. (eds.) Novel Molecular Structure Descriptors-Theory and Applications I, pp. 101–136. University of Kragujevac, Kragujevac (2010)
Lučić, B., Trinajstić, N., Zhou, B.: Comparison between the sum-connectivity index and product-connectivity index for benzenoid hydrocarbons. Chem. Phys. Lett. 475, 146–148 (2009)
Nešetřil, J., de Mendez, P.O.: On first-order definable colorings. In: Matoušek, J., Nešetřil, J., Pellegrini, M. (eds.) Geometry, Structure and Randomness in Combinatorics, vol. 18, pp. 99–122. CRM Series, Edizioni della Normale, Pisa (2014)
Nikolić, S., Kovačević, G., Miličević, A., Trinajstić, N.: The Zagreb indices 30 years after. Croat. Chem. Acta 76(2), 113–124 (2003)
Onagh, B.N.: The harmonic index of subdivision graphs. Trans. Comb. 6, 15–27 (2017)
Onagh, B.N.: The harmonic index of product graphs. Math. Sci. 11(3), 203–209 (2017)
Onagh, B.N.: The harmonic index of edge-semitotal graphs, total graphs and related sums. Kragujev. J. Math. 42(2), 217–228 (2018)
Randić, M.: On characterization of molecular branching. J. Am. Chem. Soc. 97, 6609–6615 (1975)
Sarala, D., Deng, H., Ayyaswamy, S.K., Balachandran, S.: The Zagreb indices of graphs based on four new operations related to the lexicographic product. Appl. Math. Comput. 309, 156–169 (2017)
Shwetha, B.S., Lokesha, V., Ranjini, P.S.: On the harmonic index of graph operations. Trans. Comb. 4(4), 5–14 (2015)
Xu, X.: Relationships between harmonic index and other topological indices. Appl. Math. Sci. 6, 2013–2018 (2012)
Yan, W., Yang, B.-Y., Yeh, Y.-N.: The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl. Math. Lett. 20, 290–295 (2007)
Zhong, L.: The harmonic index for graphs. Appl. Math. Lett. 25, 561–566 (2012)
Zhong, L.: The harmonic index on unicyclic graphs. Ars Comb. 104, 261–269 (2012)
Zhong, L.: On the harmonic index and the girth for graphs. Rom. J. Inf. Sci. Technol. 16(4), 253–260 (2013)
Zhou, B., Trinajstić, N.: On a novel connectivity index. J. Math. Chem. 46, 1252–1270 (2009)
Zhou, B., Trinajstić, N.: On general sum-connectivity index. J. Math. Chem. 47, 210–218 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Onagh, B.N. The harmonic index of graphs based on some operations related to the lexicographic product. Math Sci 13, 165–174 (2019). https://doi.org/10.1007/s40096-019-0287-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40096-019-0287-3