Search Results - "Khodkar, Abdollah"

On signed arc total domination in digraphs by Asgharsharghi, Leila, Khodkar, Abdollah, Sheikholeslami, S. M.

“…Let \(D=(V,A)\) be a finite simple digraph and \(N(uv)=\{u^{\prime}v^{\prime}\neq uv \mid u=u^{\prime}\text{ or }v=v^{\prime}\}\) be the open neighbourhood of…”
Get full text

SIGNED TOTAL k-DOMATIC NUMBERS OF GRAPHS by Abdollah Khodkar, S. M. Sheikholeslami

“…Let k be a positive integer and let G be a simple graph with vertex set V(G). A function <수식> is called a signed total k-dominating function if <수식> for each…”
Get full text

On the Signed (Total) K-Independence Number in Graphs by Khodkar, Abdollah, Samadi, Babak, Volkmann, Lutz

“…Let G be a graph. A function f : V (G) → {−1, 1} is a signed k- independence function if the sum of its function values over any closed neighborhood is at most…”
Get full text

SIGNED TOTAL κ-DOMATIC NUMBERS OF GRAPHS by Khodkar, Abdollah, Sheikholeslami, S.M

“…Let ${\kappa}$ be a positive integer and let G be a simple graph with vertex set V(G). A function f : V (G) ${\rightarrow}$ {-1, 1} is called a signed total…”
Get full text

Trees whose 2-domination subdivision number is 2 by Atapour, M., Sheikholeslami, S.M., Khodkar, Abdollah

“…A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\setminus S\) is adjacent to at least two vertices of \(S\)…”
Get full text

Existence of some signed magic arrays by Khodkar, Abdollah, Schulz, Christian, Wagner, Nathan

“…We consider the notion of a signed magic array, which is an m×n rectangular array with the same number of filled cells s in each row and the same number of…”
Get full text

Covering Italian domination in graphs by Khodkar, Abdollah, Mojdeh, Doost Ali, Samadi, Babak, Yero, Ismael G.

“…For a graph G = (V (G), E (G)), an Italian dominating function (ID function) of G is a function f : V (G) → {0, 1, 2} such that for each vertex v ∈ V(G) with f…”
Get full text

Twin signed k-domination numbers in directed graphs by Dehgardi, Nasrin, Atapour, Maryam, Khodkar, Abdollah

“…Let D = (V;A) be a finite simple directed graph (digraph). A function f : V ? {-1,1} is called a twin signed k-dominating function (TSkDF) if f (N-[v]) ? k and…”
Get full text

Difference Covering Arrays and Pseudo-Orthogonal Latin Squares by Demirkale, Fatih, Donovan, Diane, Hall, Joanne, Khodkar, Abdollah, Rao, Asha

“…A pair of Latin squares, A and B , of order n , is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for…”
Get full text

Direct Constructions for General Families of Cyclic Mutually Nearly Orthogonal Latin Squares by Demirkale, Fatih, Donovan, Diane, Khodkar, Abdollah

“…Two Latin squares L=[l(i,j)] and M=[m(i,j)], of even order n with entries {0,1,2,...,n−1}, are said to be nearly orthogonal if the superimposition of L on M…”
Get full text

SIGNED TOTAL κ-DOMATIC NUMBERS OF GRAPHS by Khodkar, Abdollah, Sheikholeslami, S.M.

Get full text

On 3--vertex critical graphs of diameter three by Chellali, Mustapha, Jafari Rad, Nader, Khodkar, Abdollah

“…A total dominating set of a graph G = ( V , E ) with no isolated vertex is a set S [subE] V such that every vertex is adjacent to a vertex in S . The minimum…”
Get full text

Signed Magic arrays with certain property by Book, Chanceley, Khodkar, Abdollah

“…A signed magic array, $SMA(m, n;s,t)$, is an $m \times n$ array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in…”
Get full text

Bounding the Paired-Domination Number of a Tree in Terms of its Annihilation Number by Dehgardi, Nasrin, Sheikholeslami, Seyed Mahmoud, Khodkar, Abdollah

“…A paired-dominating set of a graph 𝐺 = (𝑉, 𝐸) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The…”
Get full text

On 3-γt-vertex critical graphs of diameter three by Chellali, Mustapha, Jafari Rad, Nader, Khodkar, Abdollah

“…A total dominating set of a graph G=(V,E) with no isolated vertex is a set S⊆V such that every vertex is adjacent to a vertex in S. The minimum cardinality of…”
Get full text

On the range of influences in back-circulant Latin squares by Khodkar, Abdollah, de Launey, Warwick

“…In this note we obtain a large lower bound for the index of a certain critical set in the back-circulant Latin squares of odd order. This resolves in the…”
Get full text

The Restrained Geodetic Number of a Graph by Abdollahzadeh Ahangar, H., Samodivkin, V., Sheikholeslami, S. M., Khodkar, Abdollah

“…A geodetic set S ⊆ V ( G ) of a graph G = ( V , E ) is a restrained geodetic set if the subgraph G [ V \ S ] has no isolated vertex. The minimum cardinality of…”
Get full text

Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems by Billington, Elizabeth J., Cavenagh, Nicholas J., Khodkar, Abdollah

“…Let (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be paired together so that: (i) each pair contains a common…”
Get full text

Lower bounds on the signed domination numbers of directed graphs by Karami, H., Sheikholeslami, S.M., Khodkar, Abdollah

“…A numerical invariant of directed graphs concerning domination which is named signed domination number γ S is studied in this paper. We present some sharp…”
Get full text

Signed edge domination numbers of complete tripartite graphs: Part 2 by Khodkar, Abdollah

“…The closed neighborhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set consisting of $e$ and of all edges having an end-vertex in common with $e$. Let $f$…”
Get full text