k-subdomination in graphs

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

Title:	k-subdomination in graphs
Authors:	Chang,GJ;Liaw,SC;Yeh,HG
Contributors:	數學研究所
Keywords:	SIGNED DOMINATION;REGULAR GRAPHS;CUBIC GRAPHS
Date:	2002
Issue Date:	2010-07-07 11:43:52 (UTC+8)
Publisher:	中央大學
Abstract:	For a positive integer k, a k-subdominating function of a graph G=(VE) is a function f:V -->{-1,1} such that Sigma(uepsilonNG[nu]) greater than or equal to 1 for at least k vertices nu of G. The k-subdomination number of G, denoted by gamma(ks)(G), is the
Relation:	DISCRETE APPLIED MATHEMATICS
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	453	View/Open

社群 sharing