Results 61 to 70 of about 9,423,140 (336)
On graphs with equal domination and independent domination numbers
Discrete Mathematics, 1991 AbstractAllan and Laskar have shown that K1.3-free graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal domination independent domination numbers.are presented. In particular, the result of Allan and Laskar is generalized.
Jerzy Topp, Lutz Volkmann
openaire +2 more sources
Graphs with Total Domination Number Double of the Matching Number
Journal of New TheoryA subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj +1 more source
The Sierpiński domination number
Ars Mathematica ContemporaneaLet $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$, consisting of $|V(G)|$ copies of $H$; for every edge $gg'$ of $G$ there is an edge between copies $gH$ and $g'H$ of $H ...
Henning, Michael A +3 more
openaire +2 more sources
AIMS Mathematics, 2023 Let $ G = (V, E) $ be a simple graph with vertex set $ V $ and edge set $ E $, and let $ f $ be a function $ f:V\mapsto \{0, 1, 2\} $. A vertex $ u $ with $ f(u) = 0 $ is said to be undefended with respect to $ f $ if it is not adjacent to a vertex with ...
Jian Yang, Yuefen Chen, Zhiqiang Li
doaj +1 more source
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Bounds on the Locating Roman Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A Roman dominating function (or just RDF) 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 at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(
Jafari Rad Nader, Rahbani Hadi
doaj +1 more source
On graphs with equal domination and connected domination numbers
Discrete Mathematics, 1999 AbstractIn this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the domination number is equal to the connected domination number.
Subramanian Arumugam, J. Paulraj Joseph
openaire +2 more sources
occumb: An R package for site occupancy modeling of eDNA metabarcoding data
Population Ecology, EarlyView.This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley +1 more source
Some Results on the Strong Roman Domination Number of Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every vertex v for which f(v)=0 is
Akram Mahmoodi +2 more
doaj +1 more source
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2019 An outer independent (double) Roman dominating function is a (double) Roman dominating function f for which the set of vertices assigned 0 under f is independent.
D. Mojdeh +3 more
semanticscholar +1 more source