Results 311 to 320 of about 9,635,811 (355)

Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O, Suil, West, Douglas B.
openaire   +2 more sources

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

Trees with equal Roman {2}-domination number and independent Roman {2}-domination number

RAIRO - Operations Research, 2019
A Roman {2}-dominating function (R{2}DF) on a graph G =(V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f(v) = 2 or two vertices v1, v2 with f(v1) = f(v2) = 1. The weight of an R{2}DF f is the value w(f) = ∑u∈Vf(u).
Pu Wu, Zepeng Li, Zehui Shao, Seyed Mahmoud Sheikholeslami   +3 more
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

On the m-eternal Domination Number of Cactus Graphs

Reachability Problems, 2019
Given a graph $G$, guards are placed on vertices of $G$. Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a neighboring vertex.
Václav Blazej, J. Kristan, T. Valla
semanticscholar   +1 more source

The domination number of the king’s graph

Computational and Applied Mathematics, 2023
Muhammad Arshad, Sakander Hayat, Haziq Jamil   +2 more
semanticscholar   +1 more source

On Sombor index of trees with fixed domination number

Applied Mathematics and Computation, 2022
Xiaoling Sun, Jianwei Du
semanticscholar   +1 more source

New bounds on the double domination number of trees

Discrete Applied Mathematics, 2022
A. Cabrera-Martínez
semanticscholar   +1 more source

Trees with paired-domination number twice their domination number

2007
Udgivelsesdato ...
Henning, Michael A, Vestergaard, Preben D.   +1 more
openaire   +1 more source

Double Roman domination number

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., Aparna Lakshmanan S.
openaire   +2 more sources