1 / 10

# Coin-Graph Recognition in Complete Trees - PowerPoint PPT Presentation

Coin-Graph Recognition in Complete Trees. Amit Kumar Dey Aftab Hussain Annajiat Alim Rasel Dipankar Chaki Joy. Considering Trees. Fitting coins tree in a circle running over leaf nodes . 1 edge = 2r R = h x 2r Circumference =2 π R = 2 π (h x 2r) = 4 π rh

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Coin-Graph Recognition in Complete Trees' - manning

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Coin-Graph Recognition in Complete Trees

• Amit Kumar Dey

• AftabHussain

• AnnajiatAlimRasel

• DipankarChaki Joy

• 1 edge = 2r

• R = h x 2r

• Circumference

=2πR

= 2π(h x 2r)

= 4 π rh

• Number of nodes at leaf

= 2h

• Total Diameter of nodes

=2h x 2r

= 2h+1 x r

r

r

r

r

r

r

Tree arity Vs space required for leaf nodes

Tree Height

• combined diameter of leaf nodes

Tree arity Vs space required for leaf nodes

Tree Height

• 100 base log of combined diameter of leaf nodes

• Today’s findings:

• Maximum height of tree

• Binary tree: 5

• Ternary tree: 2

• Quarternary tree: 1

• 5-ary tree: 1

• 6-ary tree: 0 (It can be shown from the work done in 1st brainstorming workshop)

• A complete tree is NOT a coin graph

(sufficient condition)

• it is n-ary tree (n>=6)

• Its height is longer than mentioned above

• 1st workshop Findings: Tree is not a coin graph if there exists any vertex with degree > 5

• So, 6-ary tree is NOT possible

• (becomes a wheel graph with a cycle)