Bicyclic graphs with maximal revised Szeged index

Details Bicyclic graphs with maximal revised Szeged index Bicyclic graphs with maximal revised Szeged index

2011-04-12

arxiv.org/abs/1104.2122v1

Mathematics

Combinatorics

7 pages

Scientific paper

The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \geq 6$: $$ Sz^*(G)\leq \{{array}{ll} (n^3+n^2-n-1)/4,& {if $n$ is odd}, (n^3+n^2-n)/4, & {if $n$ is even}. {array}. $$ with equality if and only if $G$ is the graph obtained from the cycle $C_{n-1}$ by duplicating a single vertex. This paper is to give a confirmative proof to this conjecture.

Affiliated with

Also associated with

No associations

Rating

Bicyclic graphs with maximal revised Szeged index does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bicyclic graphs with maximal revised Szeged index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bicyclic graphs with maximal revised Szeged index will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730965