首页   按字顺浏览 期刊浏览 卷期浏览 EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS
EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS

 

作者: P.J.P. Grobler,   C.M. Mynhardt,  

 

期刊: Quaestiones Mathematicae  （Taylor Available online 1996）
卷期: Volume 19, issue 1-2  

页码: 291-313

 

ISSN:1607-3606

 

年代: 1996

 

DOI:10.1080/16073606.1996.9631840

 

出版商: Taylor & Francis Group

 

关键词: 05C70

 

数据来源: Taylor

 

摘要:

A 0-dominating function 0DF of a graphG= (V,E) is a functionf:V→ [0,1] such that ΣxεN(v)f(x) ≥ 1 for each ν εVwithf(v) = 0. The aggregate of a 0DFfis defined byag(f) = ΣvεVf(v) and the infimum and supremum of the set of aggregates over all minimal 0DFs of a graph are denoted by γ0and Γ0respectively. We prove some properties of minimal 0DFs and determine γ0and Γ0for some classes of graphs.

 

点击下载:  PDF (772KB)



返 回