A. Khodkar

activity

20142021

most citedDifference Covering Arrays and Pseudo-Orthogonal Latin Squares

12 citations · 32 across the 14 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

$(k, k^{'}, k^{''})$ -domination in graphs

Abdollah Khodkar, Babak Samadi, H. R. Golmohammadi

We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this par…

math.CO2014★ 3 cited

New bounds on the signed domination numbers of graphs

S. M. Hosseini Moghaddam, Abdollah Khodkar, Babak Samadi

In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter. As an example, we present a lower bound on signed d…

math.CO2014

Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares

Fatih Demirkale, Diane Donovan, Abdollah Khodkar

Two Latin squares $L = [l (i, j)]$ and $M = [m (i, j)]$ , of even order $n$ with entries ${0, 1, 2, \dots, n - 1}$ , are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields…

(k,k′,k′′)-domination in graphs

New bounds on the signed domination numbers of graphs

Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares

$(k, k^{'}, k^{''})$ -domination in graphs