The “friendship paradox” (Feld (1991)) refers to the fact that, on average, people have strictly fewer friends than their friends have. I show that this over-sampling of the most popular people amplifies behaviors that involve complementarities. People with more friends experience greater complementarities and hence take more extreme actions. Given the friendship paradox, people then perceive m...

Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...

In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.

The increasingly booming online social networks promote the development of online health forum. People tend to solve kinds of health issues through the Internet. However, it is still unclear what the main characteristics of friendship networks are and how the users’ attribution affect the friendship ties establishment in the online health forum. This study uses the Exponential Random Graph Mode...

To remain competitive in this global and technological world, academic institutions and corporations worldwide need to take serious steps to created a diverse, well-trained and multicultural workforce. To this end, the Global Alliance in Science and Engineering for Diversifiing the Worvorce was created to offer an opportunity to share best practices in education, industry, government and profes...

The topic of human relationships—be they positive and sympathetic, or negative and hostile—receives a great amount of attention in the Qur’ān. Human beings need to be aware of both their friends and their enemies in order to learn how to engage with both groups, how to make additional friends and defend themselves from harm caused by enemies, and, if possible, turn these enemies into friends. T...

For any simple graph H, let σ(H,n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex graph G witnessing π that contains H as a weak subgraph. Let Fk denote the friendship graph on 2k+1 vertices, that is, the graph of k triangles intersecting in a single vertex. In this paper, for n sufficiently large, σ(...