On the profile of block graphs

• Main Authors: Hao-Ying Tsai, 蔡皓盈
• Other Authors: David Kuo
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/60600234408826106962

碩士 === 國立東華大學 === 應用數學系 === 94 === Given a graph G , a proper labeling of G is a one-to-one function f from V(G) onto {1, 2,..., |V (G)|}. A proper labeling of G is called an optimal labeling if P^f(G)=P(G) .A graph G is called a block graph if every block of G is a clique. We study the profile of block graphs in this thesis. We give a formula for the profile of those block graphs whose block-cutvertex-tree is a caterpillar, and a formula for the profile of those block graphs whose block-cutvertex-tree is a 2-star. And we consider a special class of block graphs whose block-cutvertex-tree is a binary tree.