For a graph G of order |V(G)| = n and a mapping f:V(G) → R, the set of reals, if S C V(G) then /(S) = ∑_(w∈S) f(w is called the weight of S under f. The closed neighborhood sum of f is the maximum weight of a closed neighborhood under f, that is, NS[f] = max{f(N[v]) | v ∈ V(G)}. This paper introduces the closed neighborhood sum parameter for graphs, NS[G] = min{NS(f) | f:V(G) → {1, 2, ... , n} is a bijection}.
展开▼
机译：对于orderg的图表g | v（g）| = n和映射f：v（g）→r，真实集合，如果scv（g）那么/（s）=σ_（w∈s）f（w被称为s下的s的重量。该F的闭合邻域和F的最大重量在f下的封闭邻域，即ns [f] = max {f（n [v]）|v∈V（g）}。本文介绍了封闭的邻域和参数对于图表，ns [g] = min {ns（f）| f：v（g）→{1,2，...，n}是一个自卦}。
展开▼
