会议专题

Upper Bounds of Local Reverse Total Signed Domination Number in Graphs

Let G=(V,E) be a simple graph with vertex set V and edge set E. In this paper, on the basis of the local reverse total signed domination number of a graph G defined, some upper bounds of local reverse total signed domination number for general graphs are obtained, and the local reverse total signed domination numbers of circles and stars are given.

graph local reverse total signed domination number upper bounds

Zhongsheng Huang

School of Mathematics and Information Science Langfang Teachers College Langfang, China

国际会议

2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

上海

英文

129-131

2010-12-25(万方平台首次上网日期,不代表论文的发表时间)