- Research
- Open access
- Published:

# The weighted version of the handshaking lemma with an application

*Journal of Inequalities and Applications*
**volumeÂ 2014**, ArticleÂ number:Â 351 (2014)

## Abstract

The purpose of the present note is to establish the weighted version of the handshaking lemma with an application to chemical graph theory.

**MSC:**05C90.

## 1 Introduction

The graphs under consideration are finite, but may have loops and parallel edges. Let G=(V(G),E(G)) be a graph. For a vertex v\xe2\u02c6\u02c6V(G), d(v) denotes the degree of the vertex *v*, that is, the number of edges incident with *v*, where a loop incident with *v* is counted twice. We say that |V(G)| and |E(G)| are the order and size of *G*, respectively.

Around the middle of the 20th century theoretical chemists recognized that useful information on the dependence of various properties of organic substances on molecular structure can be obtained by examining pertinently constructed invariants of underlying molecular graphs. Eventually, graph invariants that are useful for chemical purpose, were named â€˜topological indicesâ€™ or â€˜molecular structure-descriptorsâ€™. A large number of various â€˜topological indicesâ€™ was proposed and studied in chemical literature [1].

In 1975, RandiÄ‡ [2] introduced the so-called â€˜branching indexâ€™. The branching index of a graph *G* is now widely known as the RandiÄ‡ index of *G*, defined as

We refer to the monograph [3] and the survey article [4] for the various results on the RandiÄ‡ index, and to [5â€“11] for some recent results concerning RandiÄ‡ index of graphs. BollobÃ¡s and ErdÅ‘s [12] showed that for a graph of order *n* without isolated vertices, R(G)\xe2\u2030\yen \sqrt{n\xe2\u02c6\u20191} with equality if and only if *G* is the star {K}_{1,n\xe2\u02c6\u20191}. The sharp upper bound for the RandiÄ‡ index of graphs of order *n* is due to Fajtlowicz [13].

**Theorem 1.1** (Fajtlowicz [13])

*For a graph* *G* *of order* *n*,

*with equality if and only if every component of* *G* *is regular and G has no isolated vertices*.

The proof of Fajtlowicz is based on Cauchyâ€™s inequality. Caporossi *et al.* [14] gave an alternative proof of Theorem 1.1 by using an equivalent formulation for the RandiÄ‡ index of a graph:

where {n}_{0} is the number of isolated vertices in *G*. Using linear programming, PavloviÄ‡ and Gutman [15] gave another proof of Theorem 1.1. In the present note, we give a short proof of Theorem 1.1, based on the weighted version of the handshaking lemma, which reads as follows.

**Theorem 1.2** (The weighted version of the handshaking lemma)

*Let* *f* *be any complex valued function defined on the vertex set of a graph* *G*. *Then*

By letting f(v)=1 for each vertex v\xe2\u02c6\u02c6V(G) in the above lemma, one can deduce the handshaking lemma.

**Corollary 1.3** (The handshaking lemma)

*For any graph* *G* *of size* *m*,

By taking the function *f* in Theorem 1.2 as

one obtains

**Corollary 1.4** *For any graph* *G* *of order* *n*,

*where* {n}_{0} *is the number of isolated vertices in* *G*.

Let {V}_{0} denote the set of isolated vertices in a graph *G*. DoÅ¡lic *et al.* established an identity similar to Theorem 1.2, which reads as follows.

**Lemma 1.5** (DoÅ¡lic *et al.* [16])

*The identity*

*holds for any graph* *G* *and any function* *f*.

Note that Theorem 1.2 is an extension of Lemma 1.5. Although both Corollary 1.4 and the following identity for the first Zagreb index {M}_{1}(G) (see [17, 18] for some recent results on this parameter) of a graph *G* can also be deduced from Lemma 1.5:

there are some which cannot be deduced from Lemma 1.5 but can be deduced from Theorem 1.2. For instance,

where {\mathrm{\xce\xbe}}_{G}(u) is the eccentricity of *u* in *G*, *i.e.*, the largest distance between *u* and any other vertex *v* of *G*. We remark that

is defined by Ghorbani and Hosseinzadeh in [19], while the eccentric connectivity index

is defined by Sharma *et al.* [20].

Another application of Theorem 1.2 is a new expression of the connective eccentricity index {\mathrm{\xce\xbe}}^{ce}(G) of a connected graph *G*, defined by Yu and Feng [21] as

By Theorem 1.2,

## 2 The proofs

*Proof of Theorem 1.2* Every term f(v) occurs d(v) times in the left hand side summation, as it occurs exactly the same times in the right hand side of the identity.â€ƒâ–¡

*Proof of Theorem 1.1* It is well known that for any two positive real numbers *a* and *b*, their geometric mean is greater than or equal to their harmonic mean, that is,

with equality if and only if a=b. Therefore, together with Corollary 1.4,

where {n}_{0} is the number of isolated vertices in *G*. If R(G)=\frac{n}{2}, we conclude from the above inequalities that {n}_{0}=0 and d(u)=d(v) for any two adjacent vertices *u* and *v* in *G*. It follows that *G* has no isolated vertices and every component of *G* is regular.

Next assume that *G* has no isolated vertices, {G}_{1},\xe2\u20ac\xa6,{G}_{k} be all components of *G*, and {G}_{i} be a {r}_{i}-regular graph of order {n}_{i} for any i\xe2\u02c6\u02c6\{1,\xe2\u20ac\xa6,k\}. Then

Thus,

by the handshaking lemma (Corollary 1.3), whence

â€ƒâ–¡

## References

Todeschini R, Consonni V:

*Handbook of Molecular Descriptors*. Wiley-HCH, Weinheim; 2000.RandiÄ‡ M:

**On characterization of molecular branching.***J. Am. Chem. Soc.*1975,**97:**6609â€“6615. 10.1021/ja00856a001Li X, Gutman I:

*Mathematical Aspects of RandiÄ‡-Type Molecular Structure Descriptors*. University of Kragujevac, Kragujevac; 2006.Li X, Shi Y:

**A survey on the RandiÄ‡ index.***MATCH Commun. Math. Comput. Chem.*2008,**59:**127â€“156.Bozkurt SB, GÃ¼ngÃ¶r AD, Gutman I, Ã‡evik AS:

**RandiÄ‡ matrix and RandiÄ‡ energy.***MATCH Commun. Math. Comput. Chem.*2010,**64:**239â€“250.DivniÄ‡ R, PavloviÄ‡ L:

**Proof of the first part of the conjecture of Aouchiche and Hansen about the RandiÄ‡ index.***Discrete Appl. Math.*2013,**161:**953â€“960. 10.1016/j.dam.2012.11.004Das KC, Sorgun S:

**On RandiÄ‡ energy of graphs.***MATCH Commun. Math. Comput. Chem.*2014,**72:**227â€“238.Gomes H, Gutman I, Martines EA, Robbiano M, San Martin B:

**On RandiÄ‡ spread.***MATCH Commun. Math. Comput. Chem.*2014,**72:**249â€“266.Liang M, Liu B:

**On the RandiÄ‡ index and girth of graphs.***Discrete Appl. Math.*2013,**161:**212â€“216. 10.1016/j.dam.2012.07.017Liu J:

**On a conjecture of the RandiÄ‡ index and the minimum degree of graphs.***Discrete Appl. Math.*2013,**161:**2544â€“2548. 10.1016/j.dam.2013.05.013Su G, Xiong L, Su X:

**Maximally edge-connected graphs and zeroth-order general RandiÄ‡ index for**0<\mathrm{\xce\pm}<1.*Discrete Appl. Math.*2014,**167:**261â€“268.BollobÃ¡s B, ErdÅ‘s P:

**Graphs of extremal weights.***Ars Comb.*1998,**50:**225â€“533.Fajtlowicz, S: Written on the Wall, a list of conjectures of Graffiti. Available from the author

Caporossi G, Gutman I, Hansen P, PavloviÄ‡ L:

**Graphs with maximum connectivity index.***Comput. Biol. Chem.*2003,**27:**85â€“90. 10.1016/S0097-8485(02)00016-5PavloviÄ‡ L, Gutman I:

**Graphs with extremal connectivity index.***Novi Sad J. Math.*2001,**31:**53â€“58.DoÅ¡lic T, Furtula B, Graovac A, Gutman I, Moradi S, Yarahmadi Z:

**On vertex-degree-based molecular structure descriptors.***MATCH Commun. Math. Comput. Chem.*2011,**66:**613â€“626.Hamzeh A, Reti T:

**An analogue of Zagreb index inequality obtained from graph irregularity measures.***MATCH Commun. Math. Comput. Chem.*2014,**72:**669â€“684.Xu K, Das KC, Balachandran S:

**Maximizing the Zagreb indices of**(n,m)**-graphs.***MATCH Commun. Math. Comput. Chem.*2014,**72:**641â€“654.Ghorbani M, Hosseinzadeh MA:

**A new version of Zagreb indices.***Filomat*2012,**26**(1):93â€“100. 10.2298/FIL1201093GSharma V, Goswami R, Madan AK:

**Eccentric connectivity index: a novel highly discriminating topological descriptor for structure-property and structure-activity studies.***J. Chem. Inf. Comput. Sci.*1997,**37:**273â€“282. 10.1021/ci960049hYu G, Feng L:

**On connective eccentricity index of graphs.***MATCH Commun. Math. Comput. Chem.*2013,**69:**611â€“628.

## Acknowledgements

The author is grateful to the referees for their helpful comments and to Professor Fajtlowicz for kindly sending a copy of â€˜Written on the Wall, a list of conjectures of Graffitiâ€™. This work was supported by NSFC (No. 11161046).

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The author declares to have no competing interests.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as 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

Wu, B. The weighted version of the handshaking lemma with an application.
*J Inequal Appl* **2014**, 351 (2014). https://doi.org/10.1186/1029-242X-2014-351

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1029-242X-2014-351