A note on the zeroth-order general randić index of cacti and polyomino chains

Authors

  • Akbar Ali National University of Computer and Emerging Sciences, Lahore-Pakistan
  • Akhlaq Bhatti National University of Computer and Emerging Sciences, Lahore, Pakistan
  • Zahid Raza National University of Computer and Emerging Sciences, Lahore, Pakistan
Abstract:

The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a note on the zeroth-order general randić index of cacti and polyomino chains

the present note is devoted to establish some extremal results for the zeroth-order general randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

full text

A Note on the ZerothOrder General Randić Index of Cacti and Polyomino Chains

The present note is devoted to establish some extremal results for the zerothorder general Randić index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

full text

A note on polyomino chains with extremum general sum-connectivity index

The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...

full text

On the Randić Index of Polyomino Chains

The Randić index R(G) of an organic molecule whose molecular graph is G is the sum of the weights (dudv)− 1 2 of all edges uv of G, where du(or dv) denote the degree of vertex u(or v). Efficient formulas for calculating the Randić index of polyomino chains are provided. Mathematics Subject Classification: 05C50, 05C12, 05C05

full text

On Sum-Connectivity Index of Polyomino Chains

If G is a (molecular) graph with n vertices, and di is the degree of its i-th vertex, then the sum-connectivity index of G is the sum of the weights (du +dv)− 1 2 of all edges uv of G. A polyomino system is a finite 2-connected plane graph such that each interior face (or say a cell) is surrounded by a regular square of length one. Formulas for calculating the sum-connectivity index of polyomin...

full text

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 5  issue 2

pages  143- 152

publication date 2014-11-01

{@ msg @}

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

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023