A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the… (More)

Nowadays almost all organizations are realizing the significance of customer centered philosophies. One of the key challenges they are facing is how to manage service quality, which holds a great… (More)

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph G = (V,E) is an orientationD of E(G) such that for every two adjacent vertices v and u, d D (v) 6= d D (u)… (More)

There is limited evidence that ginger ( shēng jiāng) powder consumption can relieve pain and inflammation because of its special phytochemical properties. This study is aimed at investigating the… (More)

A 2-hued coloring of a graph G (also known as conditional (k, 2)-coloring and dynamic coloring) is a coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at… (More)

There is limited evidence that ginger powder consumption can relieve pain and inflammation due to specific anti-inflammatory phytochemical constitutents. This study investigates the effect of ginger… (More)

The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code’s Tanner graph, collectively referred to as trapping… (More)