An upper bound for the independent domination number

CSpace

	An upper bound for the independent domination number
	Sun, L ; Wang, JF
	1999-07-01
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN	0095-8956
卷号	76 期号:2 页码:240-246
摘要	Let G be a simple graph of order n and minimum degree delta. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper we show that i(G) less than or equal to n + 2 delta - 2 root n delta. Thus a conjecture of Favaron is settled ill the affirmative. (C) 1999 Academic Press.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000081570000009
出版者	ACADEMIC PRESS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14418
专题	中国科学院数学与系统科学研究院
通讯作者	Sun, L
作者单位	1.Beijing Inst Technol, Dept Appl Math, Beijing 100081, Peoples R China 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Sun, L,Wang, JF. An upper bound for the independent domination number[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,1999,76(2):240-246.
APA	Sun, L,&Wang, JF.(1999).An upper bound for the independent domination number.JOURNAL OF COMBINATORIAL THEORY SERIES B,76(2),240-246.
MLA	Sun, L,et al."An upper bound for the independent domination number".JOURNAL OF COMBINATORIAL THEORY SERIES B 76.2(1999):240-246.