Add to ORKGA Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulant graph is a Cayley graph on a cyclic group denoted by Circ(n, S). In this paper, we address the problem domination in circulant graphs. We first give upper bounds for the domination number of certain circu-lant. The domination number of certain circulant graphs is obtained together with a corresponding dominating set. We also obtain the independent domination number and the total domination number for special cases of these circulant graphs
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Cayley graphs are constructed out of a graph and its generating set A,denoted by Cay(,A). Circulant...
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω sa...
In this paper, we characterise cubic and quartic Cayley graphs on abelian groups that admit an effic...
Let γ(n, δ) denote the largest possible domination number for a graph of order n and minimum degree ...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the di...
In this paper we compute isolate domination number and independent domination number of some well kn...
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from ...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
AbstractEfficient open dominating sets in bipartite Cayley graphs are characterized in terms of cove...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...
Cayley graphs are constructed out of a graph and its generating set A,denoted by Cay(,A). Circulant...
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω sa...
In this paper, we characterise cubic and quartic Cayley graphs on abelian groups that admit an effic...
Let γ(n, δ) denote the largest possible domination number for a graph of order n and minimum degree ...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
This paper deals with the enumeration of various families of Cayley graphs and digraphs. Both the di...
In this paper we compute isolate domination number and independent domination number of some well kn...
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from ...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
AbstractEfficient open dominating sets in bipartite Cayley graphs are characterized in terms of cove...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs wit...