On the profile of block graphs
碩士 === 國立東華大學 === 應用數學系 === 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 b...
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 |
Similar Items
-
The bandwidth sum of block graphs
by: Chih-Ying Lin, et al.
Published: (2005) -
The Node-Searching Problem on Block Graphs and Unicyclic Graphs
by: Hsin-Hung Chou, et al.
Published: (2004) -
Signed Domination in Block Graphs
by: Hsin-Ju Gong, et al.
Published: (2004) -
Block circulant graphs and the graphs of critical pairs of crowns
by: Rebecca E. Garcia, et al.
Published: (2019-10-01) -
Block designs and graph theory
by: Paterson, Lindsay
Published: (1981)