Results 221 to 230 of about 2,551 (252)

Living in the Mycelial World

Topics in Cognitive Science, EarlyView.
Abstract This manuscript documents a systematic ethnomycological analysis of ethnographic archives. Focusing on texts describing human–fungi interactions, I conduct a global, cross‐cultural review of mushroom use, covering 193 societies worldwide. The study reveals diverse mushroom‐related cultural practices, emphasizing the significance of fungi ...
Roope O. Kaaronen
wiley   +1 more source

With the advent of cyber‐social learning, it may be possible to overcome the limitations of statistical survey psychometrics and its associated methods: A multiliteracy perspective

Review of Education, Volume 14, Issue 2, August 2026.
Abstract Green and Giblin's ‘systematic review’ of multiliteracies in the December 2025 issue of this journal concludes: there is ‘no evidence’ of impact. This paper replies with a three‐layer analysis of that claim and the evidentiary regime behind it.
Bill Cope, Mary Kalantzis
wiley   +1 more source

An upper bound on the double Roman domination number

Journal of Combinatorial Optimization, 2018
From the summary: ``A double Roman dominating function (DRDF) on a graph \(G=(V, E)\) is a function \(f: V\to \{0,1, 2, 3\}\) having the property that if \(f(v)=0\), then vertex \(v\) must have at least two neighbors assigned \(2\) under \(f\) or one neighbor \(w\) with \(f(w)=3\), and if \(f(v)=1\), then vertex \(v\) must have at least one neighbor ...
Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +3 more
semanticscholar   +5 more sources

An Upper Bound on the Double Roman Domination Number

Bulletin of the Iranian Mathematical Society, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Volkmann, Lutz
semanticscholar   +3 more sources

Trees with Double Roman Domination Number Twice the Domination Number Plus Two

Iranian Journal of Science and Technology, Transactions A: Science, 2018
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ is a function $$f:V(G)\rightarrow \{0,1,2,3\}$$
H. Abdollahzadeh Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, S. M. Sheikholeslami   +4 more
semanticscholar   +4 more sources

Extremal Digraphs for an Upper Bound on the Double Roman Domination Number

Bulletin of the Malaysian Mathematical Sciences Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Blidia, Mostafa, Bouchou, Ahmed, Volkmann, Lutz   +3 more
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

New bounds on the outer-independent total double Roman domination number

Discrete Mathematics, Algorithms and Applications, 2023
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
openaire   +3 more sources

Maximal double Roman domination in graphs

Applied Mathematics and Computation, 2022
A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex ...
H. Ahangar, M. Chellali, S. Sheikholeslami, J. Valenzuela-Tripodoro   +3 more
semanticscholar   +2 more sources

Double Roman domination subdivision number in graphs

Asian-European Journal of Mathematics, 2021
For a graph [Formula: see text], a double Roman dominating function is a function [Formula: see text] having the property that if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor with [Formula: see text], and if [Formula: see text], then vertex [
Amjadi, J., Sadeghi, H.
openaire   +3 more sources