ABSTRACT: A set is a dominating set of G if every vertex of is adjacent to at least one vertex of S. The cardinality of the smallest dominating set of G is called the domination number of G. The ...

Abstract: A graph $(G)$ is conditional $(k)$-edge-fault Hamiltonian if it remains Hamiltonian after deleting at most $(k)$ edges and each vertex incident to at least two nonfaulty edges. A graph $(G)$ ...