On Sum--Connectivity Index of Bicyclic Graphs

Zhibin Du; Bo Zhou

On Sum--Connectivity Index of Bicyclic Graphs

Combinatorics 2012-02-28 v1

Authors: Zhibin Du , Bo Zhou

Abstract

We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$ , where $2\le m\le \lfloor\frac{n}{2}\rfloor$ , the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\ge 5$ vertices. The extremal graphs are characterized.

Keywords

graph connectivity graph pebbling graph theory

Cite

@article{arxiv.0909.4577,
  title  = {On Sum--Connectivity Index of Bicyclic Graphs},
  author = {Zhibin Du and Bo Zhou},
  journal= {arXiv preprint arXiv:0909.4577},
  year   = {2012}
}

Related papers

View all related →