Results 61 to 70 of about 9,767,318 (248)
V diplomskem delu je predstavljena t.i. rimska dominacija, gre za eno izmed različic običajne dominacije. V prvem delu so na kratko povzeti osnovni pojmi iz teorije grafov. V nadaljevanju govorimo o značilnostih dominantne množice in dominantnega števila.
Starčevič, Jasmina
core
Roman Domination in Complementary Prisms [PDF]
The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect matching between the corresponding vertices of G and G. A Roman dominating function on a graph G = (V, E) is a labeling f:
Haynes, Teresa W. +2 more
core +3 more sources
A note on the edge Roman domination in trees
A subset $X$ of edges of a graph $G$ is called an \textit{edgedominating set} of $G$ if every edge not in $X$ is adjacent tosome edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the minimum cardinality taken over all edge dominating sets of
Nader Jafari Rad
doaj +1 more source
The Number of Minimum Dominating Sets in Pn × P2 [PDF]
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar +5 more
core +1 more source
Variants of the Domination Number for Flower Snarks [PDF]
We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine
Burdett, Ryan +2 more
core
Abstract The cortical bone structure of long bone diaphyses changes throughout growth via skeletal modeling and has important implications for bone strength and structural integrity. Ontogenetic trends in diaphyseal structure have been identified in both chimpanzees and humans but it is not yet clear how these trends compare given notable differences ...
Karen R. Swan +3 more
wiley +1 more source
Total Roman Reinforcement in Graphs
A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Abstract The Iberian wolf (Canis lupus signatus) is an endangered subspecies characterized by highly fragmented populations and increasing human–carnivore conflict across the Iberian Peninsula. Although body mass strongly influences predator–prey dynamics and ecological performance, quantitative assessments of sexual size dimorphism (SSD) and body mass
Leonardo Cotts +4 more
wiley +1 more source
Abstract The tongue‐bite apparatus (TBA) is a secondary jaw system found in Osteoglossomorpha and, convergently, Salmonidae. It is thought to have similar prey‐processing functions as the pharyngeal jaws, possibly allowing the oral jaws to evolve separately for more efficient prey capture.
Kassandra L. Ford +2 more
wiley +1 more source
ABSTRACT Medieval and early modern drowned villages in the intertidal zone of the Scheldt estuary (the Netherlands) constitute intriguing yet largely understudied components of north‐western Europe's underwater cultural heritage. Despite their high archaeological potential as time capsules of past settlement landscapes, research has remained limited ...
Jan Trachet +9 more
wiley +1 more source

