Results 91 to 100 of about 1,516 (111)
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. G. 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
Total Strong Litact Domination in Graphs
, 2021In this paper, a new domination number called total strong litact domination number is defined on a graph and values of the defined variant to standard graphs, general graphs, trees etc., are acquired and endeavoured to raise a association among the ...
R. Avvari, Vani Manda, Ramprasad Chegu
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
Secure convex domination in a graph
, 2015In this paper, we give necessary and sufficient conditions for a subset S of the vertex set of a connected graph G to be a secure convex dominating set. Some realization problems will be given.
Enrico L. Enriquez, S. Canoy
semanticscholar +1 more source
Restrained convex dominating sets in the corona and the products of graphs
, 2015In this paper, we characterize the restrained convex dominating sets in the corona, lexicographic and Cartesian products of two connected graphs and then determine the corresponding restrained convex domination numbers of these graphs.
Enrico L. Enriquez, S. Canoy
semanticscholar +1 more source
, 2015
Let G = (V (G), E(G)) be an arbitrary graph and let X ⊆ V (G). The set A(X) = X ∩ N(X) consists of the non-isolates in X, where N(X) = {y ∈ V (G) : yx ∈ E(G) for some x ∈ X}. Let B(X) denote the set of vertices in V (G)\X that has a neighbor in X.
C. Armada, S. Canoy
semanticscholar +1 more source
Let G = (V (G), E(G)) be an arbitrary graph and let X ⊆ V (G). The set A(X) = X ∩ N(X) consists of the non-isolates in X, where N(X) = {y ∈ V (G) : yx ∈ E(G) for some x ∈ X}. Let B(X) denote the set of vertices in V (G)\X that has a neighbor in X.
C. Armada, S. Canoy
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
1-Movable independent domination in graphs
, 2015This paper presents some characterizations involving the concept of 1-movable independent domination in graphs and investigates the 1-movable independent dominating sets in the join and corona of graphs.
Renario G. Hinampas, S. Canoy
semanticscholar +1 more source