Abdollah Khodkar

According to our database1, Abdollah Khodkar authored at least 55 papers between 1993 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Covering Italian domination in graphs.
Discret. Appl. Math., 2021

2020
Signed domination and Mycielski's structure in graphs.
RAIRO Oper. Res., 2020

Signed magic rectangles with three filled cells in each column.
Bull. ICA, 2020

2017
Existence of some signed magic arrays.
Discret. Math., 2017

Bounds on several versions of restrained domination number.
Contributions Discret. Math., 2017

2016
Difference Covering Arrays and Pseudo-Orthogonal Latin Squares.
Graphs Comb., 2016

2015
On the signed (total) <i>k</i>-independence number in graphs.
Discuss. Math. Graph Theory, 2015

New bounds on the signed domination numbers of graphs.
Australas. J Comb., 2015

2013
Signed edge k-subdomination numbers in graphs.
Ars Comb., 2013

Roman domination subdivision number of a graph and its complement.
Ars Comb., 2013

2012
Connected Domination Number of a Graph and its Complement.
Graphs Comb., 2012

Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems.
Discret. Math., 2012

On 3-y<sub>t</sub>-vertex critical graphs of diameter three.
Discret. Appl. Math., 2012

Signed edge majority total domination numbers in graphs.
Ars Comb., 2012

Identifying flaws in the security of critical sets in latin squares via triangulations.
Australas. J Comb., 2012

2011
The Signed Bad numbers in Graphs.
Discret. Math. Algorithms Appl., 2011

An upper bound for total domination subdivision numbers.
Ars Comb., 2011

2010
Signed (b, k)-Edge Covers in Graphs.
Intell. Inf. Manag., 2010

Super edge-graceful labelings of complete bipartite graphs.
Australas. J Comb., 2010

2009
An Upper Bound for the Total Domination Subdivision Number of a Graph.
Graphs Comb., 2009

Lower bounds on the signed domination numbers of directed graphs.
Discret. Math., 2009

Signed Edge Domination Numbers In Trees.
Ars Comb., 2009

2008
Some Notes on Signed Edge Domination in Graphs.
Graphs Comb., 2008

On the range of influences in back-circulant Latin squares.
Discret. Math., 2008

When is a partial Latin square uniquely completable, but not its completable product?
Discret. Math., 2008

Signed edge majority domination numbers in graphs.
Australas. J Comb., 2008

2007
More on even <i>[a, b]</i>-factors in graphs.
Discuss. Math. Graph Theory, 2007

Characterization of double domination subdivision number of trees.
Discret. Appl. Math., 2007

Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).
Ars Comb., 2007

The Forcing Domination Numbers Of Some Graphs.
Ars Comb., 2007

On The Spectrum Of Critical Sets In Back Circulant Latin Squares.
Ars Comb., 2007

On perfect double dominating sets in grids cylinders and tori.
Australas. J Comb., 2007

2006
The defining numbers for vertex colorings of certain graphs.
Australas. J Comb., 2006

2004
On a generalization of the Oberwolfach problem.
J. Comb. Theory, Ser. A, 2004

An investigation of 2-critical sets in latin squares.
Ars Comb., 2004

Families of 2-critical sets for dihedral groups.
Australas. J Comb., 2004

2003
Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems.
Graphs Comb., 2003

A census of critical sets in the Latin squares of order at most six.
Ars Comb., 2003

2002
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges.
Int. J. Comput. Math., 2002

Latin Interchanges and Direct Products.
Ars Comb., 2002

2001
The mu-way intersection problem for m-cycle systems.
Discret. Math., 2001

Smallest weak and smallest totally weak critical set in the latin squares of order at most seven.
Ars Comb., 2001

2000
On Alspach's conjecture with two even cycle lengths.
Discret. Math., 2000

Maximum packings of Kv - Ku with triples.
Ars Comb., 2000

The fine structure of (v, 3) directed triple systems: v = 2 (mod 3).
Ars Comb., 2000

The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2.
Ars Comb., 2000

1999
On minimum possible volumes of strong Steiner trades.
Australas. J Comb., 1999

1998
On Orthogonal Double Covers of Graphs.
Des. Codes Cryptogr., 1998

On the non-existence of Steiner (v, k, 2) trades with certain volumes.
Australas. J Comb., 1998

1997
The intersection problem for cubes.
Australas. J Comb., 1997

1996
The fine structure of (v, 3) directed triple systems: v = 0 or 1 (mod 3).
Ars Comb., 1996

1995
Numbers of common triples in simple balanced ternary designs.
Ars Comb., 1995

Discrete Optimisation and Fast Correlation Attacks.
Proceedings of the Cryptography: Policy and Algorithms, 1995

1994
Various super-simple designs with block size four.
Australas. J Comb., 1994

1993
Balanced ternary designs with holes and numbers of common triples.
Australas. J Comb., 1993


  Loading...