Results 31 to 40 of about 11,106,432 (291)
Outer independent total double Italian domination number [PDF]
Computer Science Journal of MoldovaIf $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
On graphs with equal domination and independent domination numbers
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jerzy Topp, Lutz Volkmann
openaire +3 more sources
Graphs with equal Grundy domination and independence number
Discrete Optimization, 2023 The Grundy domination number, ${γ_{\rm gr}}(G)$, of a graph $G$ is the maximum length of a sequence $(v_1,v_2,\ldots, v_k)$ of vertices in $G$ such that for every $i\in \{2,\ldots, k\}$, the closed neighborhood $N[v_i]$ contains a vertex that does not belong to any closed neighborhood $N[v_j]$, where ...
Gábor Bacsó +3 more
openaire +5 more sources
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
On the Number of k‐Dominating Independent Sets [PDF]
Journal of Graph Theory, 2016 AbstractWe study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erdős and Moser—is widely investigated, much less is known in general.
openaire +6 more sources
A note on the independent domination number of subset graph [PDF]
, 1988 summary:The independent domination number $i(G)$ (independent number $\beta (G)$) is the minimum (maximum) cardinality among all maximal independent sets of $G$.
Favaron, O. +4 more
core +1 more source
Independent Rainbow Domination Numbers of Generalized Petersen Graphs P(n,2) and P(n,3)
Mathematics, 2020 We obtain new results on independent 2- and 3-rainbow domination numbers of generalized Petersen graphs P ( n , k ) for certain values of n , k ∈ N . By suitably adjusting and applying a well established technique of tropical algebra (path
Boštjan Gabrovšek +2 more
doaj +1 more source
An Upper Bound for the Independent Domination Number
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang Sun, Jianfang Wang
openaire +2 more sources
An improved upper bound on the independent double Roman domination number of trees
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least two ...
F. Nahani Pour +3 more
doaj +1 more source
On graphs whose domination numbers equal their independent domination numbers
Electronic Notes in Discrete Mathematics, 2003 Abstract In this paper, we extend a result due to R. B. Allan and R. C. Laskar on graphs whose independent domination numbers equal their domination numbers. We will consider finite simple graphs as treated in most of the standard text-books on Graph Theory (e.g., see D. B. West [1]). Let G = (V,E) be any graph and D ⊆ V. We let N(D) denote the set
B. Devadas Acharya, Purnima Gupta
openaire +2 more sources