No systematic study discusses the evolution of fair and equitable benefit-sharing across various areas of international law (environment, human rights, oceans), as well as at different levels of regulation (regional and national laws and guidelines, private law contracts, transboundary codes of conduct, customary laws of indigenous peoples and local communities). This article explores the usefu...

let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...

A subset D of ( ) V G is called an equitable dominating set if for every ( ) v V G D   there exists a vertex u D  such that ( ) uv E G  and | ( ) ( ) | 1 deg u deg v   . A subset D of ( ) V G is called an equitable independent set if for any , u D v   ( ) e N u for all { } v D u   . The concept of equi independent equitable domination is a combination of these two important concepts. ...

introduction: this study aimed to investigate the association between the emotional intelligence (ei) and organizational culture of university staff due to different dimensions of ei and its effects on different areas such as job progress, job satisfaction, job environment and organizational performance. methods: this was an analytical and cross-sectional study. it was done on 168 staff of isfa...

By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold

The paper is devoted to the combinatorial problem concerning equitable colorings of non-uniform simple hypergraphs. Let H = (V,E) be a hypergraph, a coloring with r colors of its vertex set V is called equitable if it is proper (i.e. none of the edges is monochromatic) and the cardinalities of the color classes differ by at most one. We show that if H is a simple hypergraph with minimum edge-ca...

A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, which the required minimum number of colors is called the equitable total chromatic number. In this paper, we prove some theorems on equitable total coloring and derive the equitable total chromatic numbers of Pm ∨ Sn, Pm ∨ Fn and Pm ∨Wn. Keyw...

Health promotion is the process of actively engaging individuals and providers, assuring access to the necessary health information and tools, and facilitating a conducive environment to enable people and their communities to gain control over their health. As defined by the World Health Organization (WHO) [1] this process involves the establishment of initiatives that are “empowering, particip...

Let be a graph. If  , G V E    is a function from the vertex set   V G to the set of positive integers. Then two vertices are   G , u v V   -equitable if     1 u v     . By the degree, equitable adjacency between vertices can be redefine almost all of the variants of the graphs. In this paper we study the degree equitability of the graph by defining equitable connectivity, equ...