Signed Domination in Block Graphs Signed Domination in Block Graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/7852

Title:	Signed Domination in Block Graphs Signed Domination in Block Graphs
Authors:	龔欣如;Hsin-Ju Gong
Contributors:	數學研究所
Keywords:	Signed Domination;block graph;signed domination;block graph
Date:	2004-06-08
Issue Date:	2009-09-22 11:07:13 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	略 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.
Appears in Collections:	[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing