On Sum--Connectivity Index of Bicyclic Graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Sum--Connectivity Index of Bicyclic Graphs 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 On Sum--Connectivity Index of Bicyclic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Sum--Connectivity Index of Bicyclic Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-325168

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.