Results 41 to 50 of about 9,063,667 (65)
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees [PDF]
, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rahbani Hadi +5 more
core +1 more source
Domination parameters with number 2: interrelations and algorithmic consequences [PDF]
, 2016 In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak $2$-domination
Safe, Martin D. +4 more
core +1 more source
Another upper bound for the domination number of a graph [PDF]
, 1986 If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its domination number B(G), we show that B(G) ≤ [(n-∆-1) (n- δ-2)/(n-1 ...
Marcu, Danut
core
, 2002 The game domination number of a (simple, undirected) graph is defined by the following game. Two players, A and D, orient the edges of the graph alternately until all edges are oriented.
Bollobás, Béla +4 more
core +1 more source
ON TREES WITH DOUBLE DOMINATION NUMBER EQUAL TO 2-DOMINATION NUMBER PLUS ONE
, 2013 A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G) is a 2-dominating set of G if every vertex of V (G) \ D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G
Marcin Krzywkowski
core
Trees With Large Paired-Domination Number
, 2006 A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is bounded above by twice the domination number of G.
Haynes, Teresa, Henning, Michael A.
core +1 more source
Domination parameters: Roman domination number
, 2022 Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core
Anarchism and non-domination [PDF]
, 2019 In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402) +1 more
core
Sum of Out-domination Number and In-domination Number of Digraphs
, 2015 设S是有向图d的一个顶点子集,若d的每个不在S中的顶点都邻接自(到)S的某个(些)顶点,则称S是d的出(入)控制集.d的出(入)控制数是d的出(入)控制集的最小基数.给出了有向图关于出控制数与入控制数之和的上界,部分改进了CHArTrAnd等给出的相应结果.A vertex subset Sof a digraph Dis called an out-dominating(in-dominating)set of Dif every vertex outside Sis adjacent from(to)
郝国亮, 钱建国
core
Some of the next articles are maybe not open access.
Related searches:
Related searches: