Results 81 to 90 of about 1,497 (106)
On the total domination subdivision numbers in graphs
Open Mathematics, 2010 Sheikholeslami Seyed
doaj +1 more source
A lower bound for the packing chromatic number of the Cartesian product of cycles
Open Mathematics, 2013 Jacobs Yolandé +2 more
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Domination defect for the join and corona of graphs
Applied Mathematical Sciences, 2021The domination number of a graph G denoted by γ(G) is the minimum number of vertices required to dominate all the vertices of G. The minimality of γ(G) implies that if W ⊆ V (G) such that |W | < γ(G), then there is at least one vertex of G that is not ...
Aldwin T. Rolito G. Eballe, R. G. Eballe
semanticscholar +1 more source
Weakly connected 2-domination in graphs
Applied Mathematical Sciences, 2021Let G = (V (G), E(G)) be a connected graph. A set D ⊆ V (G) is a weakly connected 2-dominating set 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
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. G. Eballe
semanticscholar +1 more source
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
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
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