On circuits in graphs. - Mohamed H. El-Zahar (Discret. Math., 1984)

Greedy linear extensions to minimize jumps. - Mohamed H. El-Zahar; I. Rival (Discret. Appl. Math., 1985)

On the weight distribution of the coset leaders of the first-order Reed - Muller code. - Mohamed H. El-Zahar; Mahmoud K. Khairat (IEEE Trans. Inf. Theory, 1987)

Counting two-dimensional posets. - Bayoumi I. Bayoumi; Mohamed H. El-Zahar; Soheir Mohamed Khamis (Discret. Math., 1994)

A graph-theoretic version of the union-closed sets conjecture. - Mohamed H. El-Zahar (J. Graph Theory, 1997)

On sphere orders. - Mohamed H. El-Zahar; Lobna A. Fateen (Discret. Math., 1998)

On Jump-Critical Posets with Jump-Number Equal to Width. - Mohamed H. El-Zahar (Order, 2000)

Some Results for Some Conjectures in Addition Chains. - Hatem M. Bahig; Mohamed H. El-Zahar; Ken Nakamula (DMTCS, 2001)

On the Domination Number of the Product of Two Cycles. - Mohamed H. El-Zahar; Ramy S. Shaheen (Ars Comb., 2007)

On the domination number of the cartesian product of the cycle of length n and any graph. - Mohamed H. El-Zahar; Soheir Mohamed Khamis; Khalida Mohammad Nazzal (Discret. Appl. Math., 2007)