Learn More
We first show that if a graph G of order n contains a hamiltonian path connecting two nonadjacent vertices u and v such that d(u) + d(v) ≥ n, then G is pancyclic. By using this result, we prove that if G is hamiltonian with order n ≥ 20 and if G has two nonadjacent vertices u and v such that d(u) + d(v) ≥ n + z, where z = 0 when n is odd and z = 1(More)
A set S is an offensive alliance if for every vertex v in its boundary N (S) − S it holds that the majority of vertices in v's closed neighbourhood are in S. The offensive alliance number is the minimum cardi-nality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a(More)