How to Generate a Function for Vertex Distance in a Planar Tree?

Click For Summary
SUMMARY

The discussion focuses on generating functions for vertex distances in a planar tree with $n$ non-root vertices. The primary goal is to derive an exponential generating function for the distance $d$ from the root and to prove the total number of such vertices using the formula $$\displaystyle \binom{2n}{n-d}\frac{2d+1}{(n+d+1)}$$. The Lagrange Inversion Theorem is identified as a key tool for this derivation. Participants are encouraged to share any progress or partial proofs related to the problem.

PREREQUISITES
  • Understanding of planar trees and their properties
  • Familiarity with exponential generating functions
  • Knowledge of the Lagrange Inversion Theorem
  • Basic combinatorial mathematics
NEXT STEPS
  • Study the application of the Lagrange Inversion Theorem in combinatorial contexts
  • Explore exponential generating functions in depth
  • Research properties of planar trees and their vertex structures
  • Investigate combinatorial proofs related to vertex counting in trees
USEFUL FOR

Mathematicians, combinatorial theorists, and computer scientists interested in graph theory and tree structures will benefit from this discussion.

Howang
Messages
1
Reaction score
0
Hi,

Please I need you help to solve this problem:

----------

Consider a planar tree with $n$ non-root vertices (root edge selected).

1. Give a generating function for vertices distance $d$ from the root.
2. Proof that the total number is $$\displaystyle \binom{2n}{n-d}\frac{2d+1}{(n+d+1)}$$

----------

We are supposed to have an exponential generating function then use Lagrange Inversion Theorem.
 
Physics news on Phys.org
Hello there, Howang! :D

Have you managed a partial proof, or made any inroads into solving this problem? If so, please DO share.

Thanks!

Gethin
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 61 ·
3
Replies
61
Views
10K
  • · Replies 8 ·
Replies
8
Views
3K