In this paper, we characterise cubic and quartic Cayley graphs on abelian groups that admit an efficient dominating set, and then we give domination numbers, even when they do not have an efficient dominating set, when it is possible.No sponso
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from ...
AbstractGiven a simple graph G=(V,E), a vertex v∈V is said to dominate itself and all vertices adjac...
[[abstract]]We show that the efficient minus (resp., signed) domination problem is NP-complete for c...
Necessary and sufficient conditions for the existence of an efficient dominating set and an efficien...
An independent subset D of the vertex set V of the graph is an effcient dominating set for this gra...
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω sa...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
In this paper we compute isolate domination number and independent domination number of some well kn...
AbstractEfficient open dominating sets in bipartite Cayley graphs are characterized in terms of cove...
AbstractAn independent set of vertices S of a graph dominates the graph efficiently if every vertex ...
A dominating set S of a graph G is called efficient if |N[v]∩ S| = 1 for every vertex v ∈ V(G). That...
A dominating set S of a graph G is called efficient if |N [v]∩S | = 1 for every vertex v ∈ V (G). T...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and ...
[[abstract]]Given a simple graph G = (V,E), a vertex v is a member of the set of V is said to domina...
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from ...
AbstractGiven a simple graph G=(V,E), a vertex v∈V is said to dominate itself and all vertices adjac...
[[abstract]]We show that the efficient minus (resp., signed) domination problem is NP-complete for c...
Necessary and sufficient conditions for the existence of an efficient dominating set and an efficien...
An independent subset D of the vertex set V of the graph is an effcient dominating set for this gra...
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω sa...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
In this paper we compute isolate domination number and independent domination number of some well kn...
AbstractEfficient open dominating sets in bipartite Cayley graphs are characterized in terms of cove...
AbstractAn independent set of vertices S of a graph dominates the graph efficiently if every vertex ...
A dominating set S of a graph G is called efficient if |N[v]∩ S| = 1 for every vertex v ∈ V(G). That...
A dominating set S of a graph G is called efficient if |N [v]∩S | = 1 for every vertex v ∈ V (G). T...
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighbo...
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and ...
[[abstract]]Given a simple graph G = (V,E), a vertex v is a member of the set of V is said to domina...
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from ...
AbstractGiven a simple graph G=(V,E), a vertex v∈V is said to dominate itself and all vertices adjac...
[[abstract]]We show that the efficient minus (resp., signed) domination problem is NP-complete for c...
DOI
Add to ORKG