Results 91 to 100 of about 477 (116)
Some of the next articles are maybe not open access.
Weakly connected 2-domination in some special graphs
, 2021Let G = (V (G), E(G)) be a connected graph. A set D ⊆ V (G) is a weakly connected 2-dominating set of G if every vertex of V (G)\D is adjacent to at least two vertices in D and the subgraph 〈D〉w weakly induced by D is connected.
Mae P. Militante, R. Eballe
semanticscholar +1 more source
Exploring the vertex and edge corona of graphs for their weakly connected 2-domination
International Journal of Contemporary Mathematical Sciences, 2021A weakly connected 2-dominating set of a connected graph G is a set D ⊆ V (G) such that every vertex in V (G)\D is adjacent to at least two vertices in D and the subgraph 〈D〉w, which is the one weakly induced by D, is connected. In this paper, the weakly
Mae P. Militante, R. Eballe
semanticscholar +1 more source
Applied Mathematical Sciences, 2021
In a graph G = (V,E), an independent set is a subset I of V (G) such that no two vertices in I are adjacent. A maximum independent set is an independent set of maximum size.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar +1 more source
In a graph G = (V,E), an independent set is a subset I of V (G) such that no two vertices in I are adjacent. A maximum independent set is an independent set of maximum size.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar +1 more source
Weak-trees with equal distance-2 domination and independent domination
, 2021The distance between two vertices u and v in a graph equals the length of a shortest path from u to v. The distance-2 domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a vertex subset where every vertex not belonging to the ...
Guorong Gao, Min-Jen Jou, Jenq-Jong Lin
semanticscholar +1 more source
Trees with the total domination number twice the distance-2 domination number
, 2021The distance between two vertices u and v in a graph equals the length of a shortest path from u to v. The distance-2 domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a vertex subset where every vertex not belonging to the ...
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source
On the 2-independence number of trees
, 2020The distance between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is a 2independent set if the distance between any two elements in S is greater than two in G.
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source
On [ k ] -Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023Seyed Mahmoud Sheikholeslami
exaly
The Domination Number of Grids
SIAM Journal on Discrete Mathematics, 2011Alexandre Pinlou +2 more
exaly