Results 231 to 240 of about 315,031 (267)

2-Independent Domination in Trees

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gang Zhang, Baoyindureng Wu
openaire   +1 more source

Independent Domination in Cubic Graphs

Journal of Graph Theory, 2015
AbstractA set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by , is the minimum cardinality of an independent dominating set.
Dorbec, Paul, Henning, Michael A., Montassier, Mickael, Southey, Justin   +3 more
openaire   +2 more sources

Independent Rainbow Domination of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zehui Shao, Zepeng Li, Aljoša Peperko, Jiafu Wan, Janez Žerovnik   +4 more
openaire   +1 more source

Trees with independent Roman domination number twice the independent domination number

Discrete Mathematics, Algorithms and Applications, 2015
A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text].
Chellali, Mustapha, Rad, Nader Jafari
openaire   +2 more sources

Independent Double Roman Domination in Graphs

Bulletin of the Iranian Mathematical Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maimani, Hamidreza, Momeni, Mostafa, Nazari Moghaddam, Sakineh, Rahimi Mahid, Farhad, Sheikholeslami, Seyed Mahmoud   +4 more
openaire   +1 more source

Independent Domination in Bipartite Cubic Graphs

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brause, Christoph, Henning, Michael A.
openaire   +1 more source

Domination critical graphs with higher independent domination numbers

Journal of Graph Theory, 1996
Let \(\gamma(G)\) be the domination number of a graph \(G\) and denote by \(i(G)\) its independent domination number. We say that a graph \(G\) is domination critical, if for every edge \(e\in \overline E(G)\), we have \(\gamma(G+ e)< \gamma(G)\). Obviously, \(\gamma(G)\leq i(G)\). It was conjectured that if \(G\) is a domination critical graph with \(\
Ao, S., Cockayne, E. J., MacGillivray, G., Mynhardt, C. M.   +3 more
openaire   +2 more sources