Upper Locating-Domination Numbers of Cycles  

作　　者：Yan Cai ZHAO Er Fang SHAN Ru Zhao GAO 

机构地区：[1]Foundation Department, Wuxi City College of Vocational Technology, Jiangsu 214153, P. R. China [2]Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China [3]Department of Mathematics and Physics, Bengbu College, Anhui 233030, P. R. China

出　　处：《Journal of Mathematical Research and Exposition》2011年第4期757-760,共4页数学研究与评论（英文版）

基　　金：Supported by the National Natural Science Foundation of China (Grant No.60773078);the Natural Science Foundation of Anhui Provincial Education Department (No.KJ2011B090)

摘　　要：A set D of vertices in a graph G = （V, E） is a locating-dominating set （LDS） if for every two vertices u, v of V ／ D the sets N（u） ∩D and N（v） ∩ D are non-empty and different. The locating-domination number γL（G） is the minimum cardinality of an LDS of G, and the upper-locating domination number FL（G） is the maximum cardinality of a minimal LDS of G. In the present paper, methods for determining the exact values of the upper locating-domination numbers of cycles are provided.A set D of vertices in a graph G = （V, E） is a locating-dominating set （LDS） if for every two vertices u, v of V ／ D the sets N（u） ∩D and N（v） ∩ D are non-empty and different. The locating-domination number γL（G） is the minimum cardinality of an LDS of G, and the upper-locating domination number FL（G） is the maximum cardinality of a minimal LDS of G. In the present paper, methods for determining the exact values of the upper locating-domination numbers of cycles are provided.

关 键 词：locating-domination number upper locating-domination number CYCLE 

分 类 号：O157.5[理学—数学]