45 research outputs found
On the inverse signed total domination number in graphs
In this paper, we study the inverse signed total domination number in graphs
and present new lower and upper bounds on this parameter. For example by making
use of the classic theorem of Turan (1941), we present a sharp upper bound for
graphs with no induced complete subgraph of order greater than two. Also, we
bound this parameter for a tree in terms of its order and the number of leaves
and characterize all trees attaining this bound
New bounds on the signed total domination number of graphs
In this paper, we study the signed total domination number in graphs and
present new sharp lower and upper bounds for this parameter. For example by
making use of the classic theorem of Turan, we present a sharp lower bound on
this parameter for graphs with no complete graph of order r+1 as a subgraph.
Also, we prove that n-2(s-s') is an upper bound on the signed total domination
number of any tree of order n with s support vertices and s' support vertives
of degree two. Moreover, we characterize all trees attainig this bound.Comment: This paper contains 11 pages and one figur
On the Signed -independence Number of Graphs
In this paper, we study the signed 2-independence number in graphs and give new sharp upper and lower bounds on the signed 2-independence number of a graph by a simple uniform approach. In this way, we can improve and generalize some known results in this area
Bounds on the signed distance--domination number of graphs
Abstract Let , be a graph with vertex set of order and edge set . A -dominating set of is a subset such that each vertex in \ has at least neighbors in . If is a vertex of a graph , the open -neighborhood of , denoted by , is the set , . is the closed -neighborhood of . A function 1, 1 is a signed distance--dominating function of , if for every vertex , ∑ 1. The signed distance--domination number, denoted by , , is the minimum weight of a signed distance--dominating function of . In this paper, we give lower and upper bounds on , of graphs. Also, we determine the signed distance--domination number of graph , (the graph obtained from the disjoint union by adding the edges , ) when 2
Domination in Jahangir Graph J2,m
Given graph G =(V,E), a dominating set S is a subset of vertex set V such that any vertex not in S is adjacent to at least one vertex in S. The domination number of a graph G is the minimum size of the dominating sets of G. In this paper we study some results on domination number, connected, independent, total and restrained domination number denoted by γ(G), γc(G),γi(G), γt(G) and γr(G) respectively in Jahangir graphs J2,m