March 2013

A study on hypo hamiltonian graphs

    A graph is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is called a Hamiltonian cycle of G and G is said to be a Hamiltonian graph. A Hamiltonian path is a path that contains all the vertices in V(G) but does not return to the vertex in which it began. A graph G is said to be hypo hamiltonian if for each vV (G), the vertex sub graph G-v is Hamiltonian. This paper...

Author(s):     Mushtaq Ahmad Shah

February 2013

Probabilistic analysis of two warm standby system with instructions at need

    This paper is concerned with two unit warm standby systems having one expert repairman and one assistant repairman. The assistant is called only if the expert repairman is busy. The assistant repairman who may repair the failed unit after getting instructions by his master; but sometimes the assistant repairman may repair it without having the need of instructions for doing repair with...

Author(s):     G. S. Mokaddis, Y. M. Ayed and H. S. AL-Hajeri