نتایج جستجو برای: convex domination subdivision number
تعداد نتایج: 1225418 فیلتر نتایج به سال:
This paper consists of two loosely related notes on the domination number of graphs. In the first part, we provide a new upper bound for the domination number of d-regular graphs. Our bound is the best known for d ≥ 6. In the second part, we compute the exact domination number and total domination number of certain Kneser graphs, and we provide some bounds on the domination number of other Knes...
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
The regularity of the limit function of a linear subdivision scheme is essentially irrelevant to the initial data. How data dependent, then, is the regularity of the limit of a nonlinear subdivision scheme? The answer is the most obvious it depends. In this paper, we prove that the nonlinear convexity preserving subdivision scheme developed independently by Floater/Micchelli [12] and Kuijt/van ...
Let G be an undirected connected graph with vertex and edge sets V (G) E(G), respectively. A set C ⊆ is called weakly convex hop dominating if for every two vertices x, y ∈ C, there exists x-y geodesic P(x, y) such that (P(x, y)) v (G)\C, w dG(v, w) = 2. The minimum cardinality of a G, denoted by γwconh(G), the domination number G. In this paper, we introduce initially investigate concept domin...
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
the inflation $g_{i}$ of a graph $g$ with $n(g)$ vertices and $m(g)$ edges is obtained from $g$ by replacing every vertex of degree $d$ of $g$ by a clique, which is isomorph to the complete graph $k_{d}$, and each edge $(x_{i},x_{j})$ of $g$ is replaced by an edge $(u,v)$ in such a way that $uin x_{i}$, $vin x_{j}$, and two different edges of $g$ are replaced by non-adjacent edges of $g_{i}$. t...
In this paper, we provide a new upper bound for the α-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic construction is used to generalise another well-known upper bound for the classical domination in graphs. We also prove similar upper bounds for the α-rate domination number, which combines the concepts of...
In this paper we consider the effect of edge contraction on the domination number and total domination number of a graph. We define the (total) domination contraction number of a graph as the minimum number of edges that must be contracted in order to decrease the (total) domination number. We show both of this two numbers are at most three for any graph. In view of this result, we classify gra...
This paper deals with the problem of finding convex bulges on the Pareto-front of a multi-objective optimization problem. The point of maximum bulge is of particular interest as this point shows good tradeoff properties and it is also close to the non-attainable utopia point. Our approach is to use a population based algorithm to simultaneously promote convex bulges and improve the current appr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید