Contents

Ars Combinatoria

  • Research article

Some Indices of Graphs with More Than One Cut-Edge

Jian Peng1, Guoping Wang1, Weijuan Zhang1
1School of Mathematical Sciences, Xinjiang Normal University, Urumgi 830054, Xinjiang, P. R. China
  • Published: 31/07/2016

Abstract

A bridge graph is a special one of those graphs with more than one cut-edge. In this paper, we compute Wiener, hyper-Wiener, \(PI\) and vertex \(PI\) indices of graphs with more than one cut-edge, which generalize results in [12, 13, 14].

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jian Peng, Guoping Wang, Weijuan Zhang. Some Indices of Graphs with More Than One Cut-Edge[J], Ars Combinatoria, Volume 127. 373-386. .