Signed Domination in Block Graphs Signed Domination in Block Graphs

NCU Institutional Repository > 理學院 > 數學研究所 > 博碩士論文 > Item 987654321/7852

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/7852

题名:	Signed Domination in Block Graphs Signed Domination in Block Graphs
作者:	龔欣如;Hsin-Ju Gong
贡献者:	數學研究所
关键词:	Signed Domination;block graph;signed domination;block graph
日期:	2004-06-08
上传时间:	2009-09-22 11:07:13 (UTC+8)
出版者:	國立中央大學圖書館
摘要:	略 In this thesis, we study the signed domination problem from an algorithmic point of view. In particular, we present some linear algorithms for finding the signed domination numbers of some special block graphs, such as block path and good block graph that every block of G has at least one vertex which is not a cut-vertex of G.
显示于类别:	[數學研究所] 博碩士論文

文件中的档案:

档案	大小	格式	浏览次数

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing