Let G=(V,E)be a graph,for an element x∈V∪E,the open total neighborhood of x is denoted by N_(t)(x)={y|y is adjacent to x or y is incident with x,y∈V∪E},and Nt[x]=Nt(x)∪{x}is the closed one.A function f:V(G)∪E(G...Let G=(V,E)be a graph,for an element x∈V∪E,the open total neighborhood of x is denoted by N_(t)(x)={y|y is adjacent to x or y is incident with x,y∈V∪E},and Nt[x]=Nt(x)∪{x}is the closed one.A function f:V(G)∪E(G)→{−1,0,1}is said to be a mixed minus domination function(TMDF)of G if∑_(y∈Nt[x])f(y)≥1 holds for all x∈V(G)∪E(G).The mixed minus domination numberγ′_(tm)(G)of G is defined as γ′_(tm)(G)=min{∑x∈V∪E f(x)|f is a TMDF of G.In this paper,we obtain some lower bounds of the mixed minus domination number of G and give the exact values ofγ′_(tm)(G)when G is a cycle or a path.展开更多
An upper bound is established on the parameter Γ -(G) for a cubic graph G and two infinite families of 3-connected graphs G k, G * k are constructed to show that the bound is sharp and, moreover, the difference Γ -(...An upper bound is established on the parameter Γ -(G) for a cubic graph G and two infinite families of 3-connected graphs G k, G * k are constructed to show that the bound is sharp and, moreover, the difference Γ -(G * k)-γ s(G * k) can be arbitrarily large, where Г -(G * k) and γ s(G * k) are the upper minus domination and signed domination numbers of G * k, respectively. Thus two open problems are solved.展开更多
For an arbitrary subset P of the reals, a function f : V →P is defined to be a P-dominating function of a graph G = (V, E) if the sum of its function values over any closed neighbourhood is at least 1. That is, fo...For an arbitrary subset P of the reals, a function f : V →P is defined to be a P-dominating function of a graph G = (V, E) if the sum of its function values over any closed neighbourhood is at least 1. That is, for every v ∈ V, f(N[v]) ≥ 1. The definition of total P-dominating function is obtained by simply changing ‘closed' neighborhood N[v] in the definition of P-dominating function to ‘open' neighborhood N(v). The (total) P-domination number of a graph G is defined to be the infimum of weight w(f) = ∑v ∈ V f(v) taken over all (total) P-dominating function f. Similarly, the P-edge and P-star dominating functions can be defined. In this paper we survey some recent progress on the topic of dominating functions in graph theory. Especially, we are interested in P-, P-edge and P-star dominating functions of graphs with integer values.展开更多
基金This work was supported by the National Natural Science Foundation of China(No.11061014,11361024,11261019)the Science Foundation of Jiangxi Province(No.KJLD12067)The authors are grateful to the referees for their careful reading with corrections and especially the referee who draws our attention to the proof in Theorem 2.2,which let us improve the proof of Theorem 2.2,and correct this lower bound.
文摘Let G=(V,E)be a graph,for an element x∈V∪E,the open total neighborhood of x is denoted by N_(t)(x)={y|y is adjacent to x or y is incident with x,y∈V∪E},and Nt[x]=Nt(x)∪{x}is the closed one.A function f:V(G)∪E(G)→{−1,0,1}is said to be a mixed minus domination function(TMDF)of G if∑_(y∈Nt[x])f(y)≥1 holds for all x∈V(G)∪E(G).The mixed minus domination numberγ′_(tm)(G)of G is defined as γ′_(tm)(G)=min{∑x∈V∪E f(x)|f is a TMDF of G.In this paper,we obtain some lower bounds of the mixed minus domination number of G and give the exact values ofγ′_(tm)(G)when G is a cycle or a path.
文摘An upper bound is established on the parameter Γ -(G) for a cubic graph G and two infinite families of 3-connected graphs G k, G * k are constructed to show that the bound is sharp and, moreover, the difference Γ -(G * k)-γ s(G * k) can be arbitrarily large, where Г -(G * k) and γ s(G * k) are the upper minus domination and signed domination numbers of G * k, respectively. Thus two open problems are solved.
基金Project supported by the National Natural Science Foundation of China (Grant No.10571117), the Shuguang Plan of Shang- hai Education Devel0pment Foundation (Grant No.06SG42), and the Natural Science Development Foundation of Shanghai Municipal Commission of Education (Grant No.05AZ04)
文摘For an arbitrary subset P of the reals, a function f : V →P is defined to be a P-dominating function of a graph G = (V, E) if the sum of its function values over any closed neighbourhood is at least 1. That is, for every v ∈ V, f(N[v]) ≥ 1. The definition of total P-dominating function is obtained by simply changing ‘closed' neighborhood N[v] in the definition of P-dominating function to ‘open' neighborhood N(v). The (total) P-domination number of a graph G is defined to be the infimum of weight w(f) = ∑v ∈ V f(v) taken over all (total) P-dominating function f. Similarly, the P-edge and P-star dominating functions can be defined. In this paper we survey some recent progress on the topic of dominating functions in graph theory. Especially, we are interested in P-, P-edge and P-star dominating functions of graphs with integer values.