ON GRAPHS SATISFYING A STRONG ADJACENCY PROPERTY Y. Ananchuen and L. Caccetta School of Mathematics and Statistics Curtin University of Technology GPO Box U1987 Perth 6001 Western Australia. Dedicated to the memory of Alan Rahilly, 1947 1992 Let m and n be nonnegative integers and k be a positive integer. A graph G is said to have property P*(m,n,k) if for any set of m + n distinct vertices of ...

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...

People exhibit group reciprocity when they retaliate, not against the person who harmed them, but against somebody else in that person's group. Group reciprocity may be a key motivation behind intergroup conflict. We investigated group reciprocity in a laboratory experiment. After a group identity manipulation, subjects played a Prisoner's Dilemma with others from different groups. Subjects the...

Objective: The ways people use for social rank (dominance vs prestige) could explain difference attitude toward five moral foundations. The aim of this study was to investigate the differential relationship between prestige, dominance and moral foundations. Methods: This study conducted with 150 participants who respond to the moral foundation questionnaire and dominance-prestige scale. Multip...

Linear orderings are an open problem for a uni ed theory of reciprocity, which, in a nutshell, can be stated in the following terms. The semantic spectrum of each other is notoriously wide. Theoreticians agree that three schema are particularly signi cant in this spectrum: strong reciprocity, weak reciprocity and linear orderings (see e.g. Beck, 2001; Gillon, 2003). Linear orderings are irrecon...

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.