The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al. [1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. They proved that this problem is strongly NP-hard and not appro...

a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f...

objectives: stigma is a negative value. many behaviors are to ward stigmatized people. down syndrome is one of conditions with stigma. the aim of this study is to determine the sources of labeling in iranian down syndrome. methods: the view of 105 down syndrome families concerning stigma were conducted. all of down syndrome was under 50 years. results: a fair proportion of down syndrome familie...

Measures of sexual wellbeing and positive aspects of sexuality in the World Health Organization definition for sexual health are rarely studied and remain poorly understood, especially among adolescents in Sub-Saharan Africa. The objective of this study was to assess sexual wellbeing in its broad sense-i.e., body image, self-esteem, and gender equitable norms-and associated factors in young ado...

This chapter explores the relationship between an equitable sharing of emission abatement targets between developed and developing countries and their incentives to participate in an international agreement to control climate change. Although developing countries face a drastic increase in their emissions, environmental efforts are not ranked among their priorities. The obvious explanation is t...

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

labeling theory is one of the most famous theories in criminology domain. the pivots of this theory consist of the role of power owners in definition of crime and determination of offender, effects of labeling and solutions for prevention of entering label. with study the pivots of labeling theory in islamic sources, we observe that however there is no similarity between religious bases and bas...