Applied Mathematical Sciences, Vol. 8, 2014, no. 123, 6103 - 6112 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48609 On Sequential Geodetic Numbers of Graphs under Some Binary Operations Lucille M. Bugo, Imelda S. Aniversario, Sergio R. Canoy, Jr. and Michael E. Subido Department of Mathematics and Statistics College of Science and Mathematics MSU-Iligan Institute of Technology Tibanga, Iligan City, Philippines Copyright c  2014 Lucille M. Bugo, Imelda S. Aniversario, Sergio R. Canoy, Jr. and Michael E. Subido. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Given two vertices u and v of a connected graph G, the closed interval I G [u, v] is that set of all vertices lying in some u-v geodesic in G. If S ⊆ V (G), then I G [S ]= ∪{I G [u, v]: u, v ∈ S }. Let v i ∈ V (G) for i =1, 2, ..., n. We select vertices of G as follows: Select v 1 and let S 1 = {v 1 }. Select another vertex v 2 = v 1 and let S 2 = {v 1 ,v 2 }. Then successively select vertex v k / ∈ S ′ k−1 and let S k = S ′ k−1 ∪{v k }∪{u ∈ V (G): u ∈ I G [v k ,w] for some w ∈ S ′ k−1 }. The sequential geodetic number of G, denoted by sgn(G) is the smallest k such that there is a sequence 〈v 1 ,v 2 , ..., v k 〉 for which S k = V (G). The set S = S ′ k = {v 1 ,v 2 ,...,v k } with v 1 ,v 2 ,...,v k ∈ S ′ k for which S k = V (G) is a sequential geodetic cover of G. The sequential geodetic number is again inspired by the achievement and avoidance games [11]. In this paper, the sequential geodetic numbers of graphs obtained from the join and corona of graphs are determined. This paper is the second part of [3].