Given an undirected graph G(V, E) with vertex set V and edge set E, the Radiocoloring of G is defined as a function f : V â†’ N such that for all pairs of vertices x, y in G |f(x) âˆ’ f(y)| â‰¥ 2 when d(x,â€¦ (More)

A defensive alliance in a graph ( ) G V E , is a set of vertices S V ! such that for every vertex v S ! , the closed neighborhood [ ] G N v of v has at least as many vertices in S as it has in V S !â€¦ (More)

We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely related. Extraction ofâ€¦ (More)

â€” We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely related. Extraction ofâ€¦ (More)

Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely related. Extractingâ€¦ (More)

A radiocoloring of a graph G is an assignment to each node, one of the colors 0, 1, 2, . . . Î» such that all pairs of adjacent nodes, get colors which differ by at least two and no pair of nodes atâ€¦ (More)