MULTISET DIMENSION OF LOBSTER GRAPH

• Main Author: Surya Tanujaya, Steven
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/36090
• Institution: Institut Teknologi Bandung

A path-subgraph of length n, P_n (k)=(VP,EP), from a connected graph G=(V,E) is called k-central-path if for every v? V, there exists v^'? VP such that d(v,v^' )? k. A lobster graph is a tree that has a 2-central-path and two-leveled rooted-tree is a lobster graph that has a 2-central-pat...