Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored b
Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and e
By using lattice paths in the three-dimensional space we obtain bijectively an interpretation for the overpartitions of a positive integer n in terms of a set o
Extreme events are defined as values of the event below or above a certain value called threshold. A well chosen threshold helps to identify the extreme levels.
Clarity and preciseness in the use of language is crucial when communicating mathematical and probabilistic ideas. Lack of these can make even the simplest prob