نتایج جستجو برای: convex domination number
تعداد نتایج: 1219040 فیلتر نتایج به سال:
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
Domination is a rapidly developing area of research in graph theory, and its various applications to ad hoc networks, distributed computing, social networks and web graphs partly explain the increased interest. This thesis focuses on domination theory, and the main aim of the study is to apply a probabilistic approach to obtain new upper bounds for various domination parameters. Chapters 2 and ...
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
in this paper we introduce the concept of topological number for locally convex topological spaces and prove some of its properties. it gives some criterions to study locally convex topological spaces in a discrete approach.
In this paper, we survey some new results in four areas of domination in graphs, namely: (1) the toughness and matching structure of graphs having domination number 3 and which are “critical” in the sense that if one adds any missing edge, the domination number falls to 2; (2) the matching structure of graphs having domination number 3 and which are “critical” in the sense that if one deletes a...
In this article we give a new definition of direct product of two arbitrary fuzzy graphs. We define the concepts of domination and total domination in this new product graph. We obtain an upper bound for the total domination number of the product fuzzy graph. Further we define the concept of total α-domination number and derive a lower bound for the total domination number of the product fuzzy ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید