Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping every person in the network knows aâ€¦ (More)

A Roman dominating function on a graph G = (V, E) is a function f : V â†’ {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) =â€¦ (More)

A function Ï€ : V â†’ {1, . . . , k} is a broadcast coloring of order k if Ï€(u) = Ï€(v) implies that the distance between u and v is more than Ï€(u). The minimum order of a broadcast coloring is calledâ€¦ (More)

Let G = (V,E) be a connected undirected graph. For any vertex v âˆˆ V , the closed neighborhood of v is N [v] = {v} âˆª {u âˆˆ V | uv âˆˆ E }. For S âŠ† V , the closed neighborhood of S is N [S] = â‹ƒ vâˆˆS N [v].â€¦ (More)

â€¢ Prospective students. There are now more than 150 doctoral programs and more than 350 masterâ€™s programs in computing in the U.S. [1, 4]. Selecting a graduate program has become a formidable task,â€¦ (More)

A defensive alliance in a graph G = (V,E) is a set of vertices S âŠ† V satisfying the condition that for every vertex v âˆˆ S, the number of neighbors v has in S plus one (counting v) is at least asâ€¦ (More)