Results 31 to 40 of about 3,632 (158)
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources
The Complexity of Secure Domination Problem in Graphs
Discussiones Mathematicae Graph Theory, 2018 A dominating set of a graph G is a subset D ⊆ V (G) such that every vertex not in D is adjacent to at least one vertex in D. A dominating set S of G is called a secure dominating set if each vertex u ∈ V (G) \ S has one neighbor v in S such that (S \ {v})
Wang Haichao, Zhao Yancai, Deng Yunping
doaj +1 more source
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Some Progress on the Double Roman Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V,E), a double Roman dominating function (or just DRDF) is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0 for a vertex v, then v has at least two neighbors assigned 2 under f or one neighbor assigned 3 under f, and ...
Rad Nader Jafari, Rahbani Hadi
doaj +1 more source
On the Total Double Roman Domination
IEEE Access, 2019 Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under f ...
Zehui Shao +3 more
doaj +1 more source
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +1 more source
MathematicsDomination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj +1 more source
On the complexity of some hop domination parameters
Electronic Journal of Graph Theory and Applications, 2019 A hop Roman dominating function (HRDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} having the property that for every vertex v ∈ V with f(v) = 0 there is a vertex u with f(u) = 2 and d(u, v) = 2. The weight of an HRDF f is the sum of its values
Nader Jafari Rad, Elahe Shabani
doaj +1 more source
Hamiltonian circuits in chordal bipartite graphs
Discrete Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Austral Ecology, Volume 51, Issue 3, March 2026.ABSTRACT Plant‐hummingbird interaction networks can be influenced by environmental conditions and resources, which vary seasonally and daily. We aimed to understand how variations in these parameters across these two temporal windows influence patterns of plant‐hummingbird interactions and hummingbirds dominance hierarchies in a Brazilian Cerrado ...
Jeane Lima‐Passos +3 more
wiley +1 more source