Semiregular Trees with Minimal Index

Details Semiregular Trees with Minimal Index Semiregular Trees with Minimal Index

2009-06-08

arxiv.org/abs/0906.1517v1

Mathematics

Combinatorics

8 pages

Scientific paper

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with index is a caterpillar. In this technical report we provide a different proof for this theorem. Furthermore, we give counter examples that show this result cannot be generalized to the class of trees with a given (non-constant) degree sequence.

Affiliated with

Also associated with

No associations

Rating

Semiregular Trees with Minimal 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 Semiregular Trees with Minimal Index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semiregular Trees with Minimal Index will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232338