Reverse degree distance of unicyclic graphs

Details Reverse degree distance of unicyclic graphs Reverse degree distance of unicyclic graphs

2011-07-12

arxiv.org/abs/1107.2171v1

Mathematics

Combinatorics

Scientific paper

The reverse degree distance is a connected graph invariant closely related to
the degree distance proposed in mathematical chemistry. We determine the
unicyclic graphs of given girth, number of pendant vertices and maximum degree,
respectively, with maximum reverse degree distances.

Affiliated with

Also associated with

No associations

Rating

Reverse degree distance of unicyclic 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 Reverse degree distance of unicyclic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse degree distance of unicyclic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-564703