Results 61 to 70 of about 9,917,456 (366)
Graphs and CombinatoricsLet G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G.
P. Dankelmann +2 more
semanticscholar +1 more source
New Results in Bi- Domination in Graphs
Zanco Journal of Pure and Applied Sciences, 2022 In this paper, some new results are introduced for the bi-domination in graphs. Some properties of bi-domination number and bounds according to maximum, minimum degrees, order, and size have been determined.
M. N. Al-Harere , Athraa T. Breesam
doaj +1 more source
Alternative Domination in Graphs
AKCE International Journal of Graphs and CombinatoricsSometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj +1 more source
Total Roman Domination Number of Rooted Product Graphs
, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
A. Cabrera Martínez +3 more
semanticscholar +1 more source
Domination numbers and homology
Journal of Combinatorial Theory, Series A, 2003 Certain homological properties of the independence complex of a graph, which is a simplicial complex on the vertex set of the graph whose simplices are all independent subsets of the vertex set, are studied, as well as their connection with domination numbers. As application Hall-type theorems for colored independent sets are proved.
openaire +3 more sources
On the ratio of the domination number and the independent domination number in graphs
Discrete Applied Mathematics, 2014 Abstract We let γ ( G ) and i ( G ) denote the domination number and the independent domination number of G , respectively. Recently, Rad and Volkmann conjectured that i ( G ) / γ ( G ) ≤ Δ ( G ) / 2 for every graph G , where Δ ( G ) is the maximum degree of G .
Akinari Sasaki +2 more
openaire +2 more sources
Bipartite graphs with close domination and k-domination numbers [PDF]
Open Mathematics, 2020 Abstract Let k k be a positive integer and let G
Ekinci, Gulnaz Boruzanli, Bujtas, Csilla
openaire +5 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
Results on the domination number and the total domination number of Lucas cubes
Ars Mathematica Contemporanea, 2020 Lucas cubes are special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we present the exact values of total domination number of small dimensional Lucas cubes and present optimization ...
openaire +3 more sources
A note on the independent domination number versus the domination number in bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 2017 Accepted by Czechoslovak Mathematical ...
Bing Wei, Shaohui Wang, Shaohui Wang
openaire +3 more sources