Research & Reviews: Discrete Mathematical Structures
Volume 5, Issue 1 (2018)
Published
Table of contents
-
Fibonacci Cordial Labeling of Some Graphs
Abstract: An injective function f: V (G) → {F0, F1, F2, . . . , Fn+1}, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function f ∗ : E(G) → {0, 1} defined by f ∗(uv) = (f (u) + f (v))(mod2) satisfies the condition |ef (0) − ef (1)| ≤ 1. A …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 1–4 Read article
-
Chromatic Curling Number of Certain Derived Graphs
Abstract: The curling number of a graph G is dened as the number of times an element in the degree sequence of G appears the maximum number of times. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring C of colours c1, c2,..., cl is said to be a minimum parameter colouring if C consists of minimum number of colours …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 10–20 Read article
-
Difference Cordial Labeling in context of Joint sum of Graphs
Abstract: Suppose G be a (p, q) graph. Suppose f be a map from f(G) to {1,2,...,p}. For each edge xy assign, the label |f(x) – f(y)|. f is difference cordial if f is 1-1 and |ef(0) – ef(1)| 14≤"> 1, where ef(1) and ef(0) denote the number of edges with labeled 1 except labeled with 1 respectively. A graph which admit difference cordial labeling is called a difference cordial graph. …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 21–25 Read article
-
E-Cordial Labeling for Theta Graph
Abstract: A binary vertex labeling f : E(G) → {0,1} with induced labeling f * : V(G) → {0,1} defined by f *(v) = ∑ { f (uv) : uv ϵ E(G)}(mod 2) is called an E-cordial labeling of graph G if the number of vertices labeled 0 and number of vertices labeled 1 differ by at most 1and the number of edges labeled 0 and number of edges labeled 1 …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 26–32 Read article
-
Analysis of Numerical and Categorical Prediction Algorithms : A Case Study of Hypertension
Abstract: An extremely wide variety and volume of data are generated by the healthcare industries which can be effectively utilized by applying data mining techniques so as to attain significant knowledge that can aid the process of decision making. In this paper an analysis of Prediction Algorithms is performed using clinical data of hypertension patients. Data mining techniques are effectively employed to estimate systolic and diastolic blood pressure of patients and …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 5–9 Read article