An improvement on the maximum number of ‐dominating independent sets [PDF]
Journal of Graph Theory, 2018 AbstractErdős and Moser raised the question of determining the maximum number of maximal cliques or, equivalently, the maximum number of maximal independent sets in a graph on vertices. Since then there has been a lot of research along these lines.A ‐dominating independent set is an independent set such that every vertex not contained in has at ...
Dániel Gerbner +4 more
openaire +4 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 +5 more
core +1 more source
Independent strong domination number of indu-bala product of graphs
, 2023 A set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set.
Priyadharshini M. +2 more
core +1 more source
Independent domination critical and stable graphs upon edge subdivision [PDF]
, 2007 A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an independent set. A graph is independent domination edge subdivision critical if the subdivision of an arbitrary edge increases the independent domination
Sharada, B. +8 more
core +1 more source
Fuzzy Graphs With Equal Fuzzy Domination And Independent Domination Numbers [PDF]
, 2013 The basic definitions of fuzzy independent set, fuzzy dominating set,and fuzzy independent dominating sets are discussed. The aim of this paper is to find on what conditions the fuzzy graph has equal domination number and independent domination number ...
Nagoorgani, A.; P.G. & Research Department of Mathematics +1 more
core
Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs [PDF]
, 2022 For a given graph G without isolated vertex we consider a function f : V (G) -> {0,1, 2}. For every i is an element of {0,1, 2}, let V-i = {v is an element of V (G) : f (v) = i}.
González Yero, Ismael +5 more
core +1 more source
Independent domination versus packing in subcubic graphs [PDF]
, 2023 In 2011, Henning, L\"{o}wenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the graph.
Cho, Eun-Kyung, Kim, Minki
core +1 more source
A note on cops and robbers, independence number, domination number and diameter
Discrete Mathematics, 2023 We study relations between diameter $D(G)$, domination number $γ(G)$, independence number $α(G)$ and cop number $c(G)$ of a connected graph $G$, showing (i.) $c(G) \leq α(G)-\lfloor \frac{D(G)-3}{2} \rfloor$, and (ii.) $c(G) \leq γ(G) - \frac{D(G)}{3} + O (\sqrt{D(G)})$.
Jan Petr, Julien Portier, Leo Versteegen
openaire +5 more sources
The ratio of domination and independent domination numbers on trees
, 2016 Accepted by Congressus Numernatium(2016)
Wang, Shaohui, Wei, Bing
openaire +3 more sources
Independent Domination in Some Wheel Related Graphs [PDF]
, 2016 A set S of vertices in a graph G is called an independent dominating set if S is both independent and dominating. The independent domination number of G is the minimum cardinality of an independent dominating set in G .
Vaidya, S. K., Pandit, R. M.
core +1 more source