Result 1 to 20 of 25 total
A note on zero-sum 5-flows in regular graphs. (English)
Electron. J. Comb. 19, No. 2, Research Paper P7, 5 p., electronic only (2012).
1
Zero-sum flows in designs. (English)
J. Comb. Des. 19, No. 5, 355-364 (2011).
2
Combinatorics and graphs. Selected papers based on the presentations at the 20th anniversary conference of IPM on combinatorics, Tehran, Iran, May 15‒21, 2009. Dedicated to Reza Khosrovshahi on the occasion of his 70th birthday. (English)
Contemporary Mathematics 531. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4865-4/pbk). ix, 264~p. \$~89.00 (2010).
3
On zero-sum 6-flows of graphs. (English)
Linear Algebra Appl. 430, No. 11-12, 3047-3052 (2009).
4
Classification of simple 2-(11,3,3) designs. (English)
Discrete Math. 309, No. 3, 515-520 (2009).
5
Special issue: International workshop on design theory, graph theory, and computational methods (IPM combinatorics II). Papers from the workshop, Tehran, Iran, April 22‒27, 2006. (English)
Discrete Math. 309, No. 3, 513-614 (2009).
6
Inclusion matrices and chains (English)
J. Comb. Theory, Ser. A 115, No. 5, 878-887 (2008).
7
Special issue: International workshop on combinatorics, linear algebra, and graph coloring, Tehran, Iran, August 9‒14, 2003. (English)
Discrete Math. 306, No. 23, 2989-3180 (2006).
8
The kernels of the incidence matrices of graphs revisited. (English)
Linear Algebra Appl. 414, No. 2-3, 617-625 (2006).
9
$\{-1,0,1\}$-basis for the null space of a forest. (English)
Linear Algebra Appl. 414, No. 2-3, 506-511 (2006).
10
On the smallest edge defining sets of graphs. (English)
Ars Comb. 63, 293-303 (2002).
11
Some designs of small orders and their codes. (English)
J. Comb. Math. Comb. Comput. 43, 101-117 (2002).
12
Theoretical aspects of computer science. Advanced lectures. (English)
Lecture Notes in Computer Science. 2292. Berlin: Springer. ix, 221 p. EUR 34.00 (net); sFr 56.50; \sterling 24.00; \$ 39.95 (2002).
13
A note on 3-factorizations of $K_{10}$. (English)
J. Comb. Des. 9, No. 5, 379-383 (2001).
14
Ternary trades and their codes. (English)
J. Stat. Plann. Inference 95, No.1-2, 237-243 (2001).
15
A new proof of a classical theorem in design theory (English)
J. Comb. Theory, Ser. A 93, No. 2, 391-396 (2001).
16
Some new 6-(14, 7, 4) designs (English)
J. Comb. Theory, Ser. A 93, No. 1, 141-152 (2001).
17
Hypergraphical codes arising from binary trades. (English)
Des. Codes Cryptography 18, No.1-3, 183-186 (1999).
18
Construction of some cyclic anti-Pasch Steiner triple systems of small orders. (English)
J. Comb. Inf. Syst. Sci. 21, No.1, 1-4 (1996).
19
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. (English)
Networks 28, No.4, 211-219 (1996).
20
Result 1 to 20 of 25 total
Start
Contact
Print
General Help
