Results 81 to 90 of about 1,516 (111)

Disjoint Paired-Dominating sets in Cubic Graphs. [PDF]

Graphs Comb, 2019
Bacsó G, Bujtás C, Tompkins C, Tuza Z.
europepmc   +1 more source

Bounds on the domination number and the metric dimension of co-normal product of graphs. [PDF]

J Inequal Appl, 2018
Javaid I, Ur Rehman S, Imran M.
europepmc   +1 more source

Locating-dominating number of certain infinite families of convex polytopes with applications. [PDF]

Heliyon
Hayat S, Kartolo N, Khan A, Alenazi MJF.
europepmc   +1 more source

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets. [PDF]

Ann Math Sil
Brewster RC, Mynhardt CM, Teshima LE.
europepmc   +1 more source

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é, Jonck Elizabeth, Joubert Ernst   +2 more
doaj   +1 more source

New bounds for the broadcast domination number of a graph

Open Mathematics, 2013
Brewster Richard, Mynhardt Christina, Teshima Laura   +2 more
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domination defect for the join and corona of graphs

Applied Mathematical Sciences, 2021
The 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, 2021
Let 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, 2021
A 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