- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j32 |      | Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar: Signed edge majority total domination numbers in graphs. Ars Comb. 105: 375-385 (2012) |
| j31 |  | Mustapha Chellali, Nader Jafari Rad, Abdollah Khodkar: On 3-yt-vertex critical graphs of diameter three. Discrete Applied Mathematics 160(4-5): 676-681 (2012) |
| j30 | | Elizabeth J. Billington, Nicholas J. Cavenagh, Abdollah Khodkar: Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. Discrete Mathematics 312(16): 2438-2445 (2012) |
| j29 | | Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar, Douglas B. West: Connected Domination Number of a Graph and its Complement. Graphs and Combinatorics 28(1): 123-131 (2012) |
| 2011 | ||
| j28 | | Hosein Karami, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami: An upper bound for total domination subdivision numbers. Ars Comb. 102: 321-331 (2011) |
| j27 | | A. N. Ghameshlou, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami: The Signed Bad numbers in Graphs. Discrete Math., Alg. and Appl. 3(1): 33-42 (2011) |
| 2010 | ||
| j26 | | A. N. Ghameshlou, Abdollah Khodkar, Reza Saei, Seyed Mahmoud Sheikholeslami: Signed (b, k)-Edge Covers in Graphs. Intelligent Information Management 2(2): 143-148 (2010) |
| 2009 | ||
| j25 | | Hosein Karami, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami: Signed Edge Domination Numbers In Trees. Ars Comb. 93 (2009) |
| j24 | | Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar: Lower bounds on the signed domination numbers of directed graphs. Discrete Mathematics 309(8): 2567-2570 (2009) |
| j23 | | Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar: An Upper Bound for the Total Domination Subdivision Number of a Graph. Graphs and Combinatorics 25(5): 727-733 (2009) |
| 2008 | ||
| j22 | | Nicholas J. Cavenagh, Diane Donovan, Abdollah Khodkar, G. H. John Van Rees: When is a partial Latin square uniquely completable, but not its completable product? Discrete Mathematics 308(13): 2830-2843 (2008) |
| j21 | | Abdollah Khodkar, Warwick de Launey: On the range of influences in back-circulant Latin squares. Discrete Mathematics 308(13): 2896-2900 (2008) |
| j20 | | Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar: Some Notes on Signed Edge Domination in Graphs. Graphs and Combinatorics 24(1): 29-35 (2008) |
| 2007 | ||
| j19 | | Nicholas J. Cavenagh, Diane Donovan, Abdollah Khodkar: On The Spectrum Of Critical Sets In Back Circulant Latin Squares. Ars Comb. 82 (2007) |
| j18 | | Abdollah Khodkar, Seyed Mahmoud Sheikholeslami: The Forcing Domination Numbers Of Some Graphs. Ars Comb. 82 (2007) |
| j17 | | D. A. Mojdeh, A. Ahmadi Haji, H. Abdollahzadeh Ahangar, Abdollah Khodkar: Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3). Ars Comb. 84 (2007) |
| j16 | | M. Atapour, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami: Characterization of double domination subdivision number of trees. Discrete Applied Mathematics 155(13): 1700-1707 (2007) |
| j15 | | Abdollah Khodkar, Rui Xu: More on even [a, b]-factors in graphs. Discussiones Mathematicae Graph Theory 27(1): 193-204 (2007) |
| 2004 | ||
| j14 | | Diane Donovan, Chin-Mei Fu, Abdollah Khodkar: An investigation of 2-critical sets in latin squares. Ars Comb. 72 (2004) |
| j13 | | Nicholas J. Cavenagh, Saad El-Zanati, Abdollah Khodkar, Charles Vanden Eynden: On a generalization of the Oberwolfach problem. J. Comb. Theory, Ser. A 106(2): 255-275 (2004) |
| 2003 | ||
| j12 | | Peter Adams, Richard Bean, Abdollah Khodkar: A census of critical sets in the Latin squares of order at most six. Ars Comb. 68 (2003) |
| j11 | | Diane Donovan, Abdollah Khodkar, Anne Penfold Street: Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems. Graphs and Combinatorics 19(1): 65-89 (2003) |
| 2002 | ||
| j10 | | Diane Donovan, Rebecca A. H. Gower, Abdollah Khodkar: Latin Interchanges and Direct Products. Ars Comb. 64: 271 (2002) |
| j9 | | Richard Bean, Diane Donovan, Abdollah Khodkar, Anne Penfold Street: Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges. Int. J. Comput. Math. 79(12): 1273-1284 (2002) |
| 2001 | ||
| j8 | | Peter Adams, Abdollah Khodkar: Smallest weak and smallest totally weak critical set in the latin squares of order at most seven. Ars Comb. 61 (2001) |
| j7 | | Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar: The mu-way intersection problem for m-cycle systems. Discrete Mathematics 231(1-3): 27-56 (2001) |
| 2000 | ||
| j6 | | |
| j5 | | Peter Adams, Darryn E. Bryant, Abdollah Khodkar: The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. Ars Comb. 56 (2000) |
| j4 | | Peter Adams, Darryn E. Bryant, Abdollah Khodkar: The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). Ars Comb. 57 (2000) |
| j3 | | Peter Adams, Darryn E. Bryant, Abdollah Khodkar: On Alspach's conjecture with two even cycle lengths. Discrete Mathematics 223(1-3): 1-12 (2000) |
| 1998 | ||
| j2 | | Darryn E. Bryant, Abdollah Khodkar: On Orthogonal Double Covers of Graphs. Des. Codes Cryptography 13(2): 103-105 (1998) |
| 1996 | ||
| j1 | | Abdollah Khodkar: The fine structure of (v, 3) directed triple systems: v = 0 or 1 (mod 3). Ars Comb. 43 (1996) |
| 1995 | ||
| c1 | | Jovan Dj. Golic, Mahmoud Salmasizadeh, Andrew Clark, Abdollah Khodkar, Ed Dawson: Discrete Optimisation and Fast Correlation Attacks. Cryptography: Policy and Algorithms 1995: 186-200 |
Colors in the list of coauthors
Last update Fri May 24 12:35:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page