The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains

Authors

  • H. Y. Deng College of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
  • Y. Tang College of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
  • Y. Zuo College of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
Abstract:

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the number of edges and $mu$ is the cyclomatic number of $G$. They are useful distance-based descriptor in chemometrics. In this paper, we focus on the extremal graphs of spiro and polyphenyl hexagonal chains with respect to the Balaban index and the sum-Balaban index.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The Maximum Balaban Index (Sum-Balaban Index) of Unicyclic Graphs

The Balaban index of a connected graph G is defined as J(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)DG(v) , and the Sum-Balaban index is defined as SJ(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)+DG(v) , where DG(u) = ∑ w∈V (G) dG(u,w), and μ is the cyclomatic number of G. In this paper, the unicyclic graphs with the maximum Balaban index and the maximum Sum-Balaban index among all unicyclic graphs on n v...

full text

The Second Largest Balaban Index (Sum-Balaban Index) of Unicyclic Graphs

Balaban index and Sum-Balaban index were used in various quantitative structureproperty relationship and quantitative structure activity relationship studies. In this paper, the unicyclic graphs with the second largest Balaban index and the second largest SumBalaban index among all unicyclic graphs on n vertices are characterized, respectively.

full text

Eccentric Connectivity Index: Extremal Graphs and Values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

full text

The Polyphenyl Chains with Extremal Edge – Wiener Indices ∗

The edge-Wiener index of a connected graph is the sum of the distances between all pairs of edges of the graph. In this paper, we determine the polyphenyl chains with minimum and maximum edge-Wiener indices among all the polyphenyl chains with h hexagons. Moreover, explicit formulas for the edge-Wiener indices of extremal polyphenyl chains are obtained.

full text

Tree-like Polyphenyl Chains with Extremal Degree Distance

Let G be a graph with vertex set V(G) and edge set E(G). For any two vertices x and y in V(G), the distance between x and y, denoted by d(x,y), is the length of the shortest path connecting x and y. The degree of a vertex v in G is the number of neighbors of v in G. Numbers reflecting certain structural features of organic molecules that are obtained from the molecular graph are usually called ...

full text

Extremal k∗-Cycle Resonant Hexagonal Chains

Denote by B∗ n the set of all k∗-cycle resonant hexagonal chains with n hexagons. For any Bn ∈ B ∗ n , let m(Bn) and i(Bn) be the numbers of matchings (=the Hosoya index) and the number of independent sets (=the Merrifield-Simmons index) of Bn, respectively. In this paper, we give a characterization of the k∗-cycle resonant hexagonal chains, and show that for any Bn ∈ B ∗ n , m(Hn) ≤ m(Bn) and ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 9  issue 4

pages  241- 254

publication date 2018-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023