A power cordial labeling of a graph G = V , E is bijection id="M2"> f : ⟶ open="{" close="}" 1,2 … open="|" close="|" such that an edge id="M3"> e u ...

A 50-year-old male, a tobacco smoker, who was known to have ulcerative colitis presented with dry cough, chest pain, dysponea and frequent passage of blood and mucous mixed stools. Physical examination revealed clubbing, subcutaneous emphysema of upper chest and auscultatory findings of crunching sound over pre-cordial area and basal crepitations. Spirometry was suggestive of restrictive patter...

The paper examined the leadership aspect of Hidden Curriculum that students practice in Nigerian Universities and their contributions to university governance. Four research questions guided the study and Ex-Post-Facto Method was adopted as the design. Unstructured interviews with staff/students officials cum critical analysis of Students’ Union Bye-Law document were the method of data collecti...

This article is devoted to the development of a device implanted in human oral cavity for continuous monitoring of the patient’s salivary fluid in order to detect occurring cardiac diseases. Miniature sensor draws in saliva at certain intervals and analyzes it for the presence of biological markers that indicate, for example, approaching myocardial infarction. If cordial markers are identified ...

Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label 1 if ρ*(ab)= | ρ(a) 2 −ρ(b) /ρ(a)−ρ(b) is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ then labeling called as divided square difference cordial graph. We prove in this paper for relatively possible set of spider graphs atmost one legs greater than namely J(SP(1 m ,...