If for any total dominating set D with ν ∈ V (G) − D there exists a vertex u ∈ D such that uν ∈ E (G) and |d(ν)−d(u)| ≤ 1 then D is called the total equitable dominating set. The minimum cardinality of the total equitable ...

A proper k - coloring of a graph G is a function f : V(G) → {1,2,..., k} such that f(u) 6= f(v) for all uv ∈ E(G). The color class Si is the subset of vertices of G that is assigned to color i. The chromatic number χ(G) ...

The zero divisor graph Γ(R) of a commutative ring R is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix M is defined ...

Recently, We defined Kasaj-topological space and weak open sets namely Kasaj-pre-open sets, Kasaj-semi-open sets, Kasaj-alpha-open sets, Kasaj-beta-open sets in Kasaj topological spaces and analyzed their basic properties. ...

Frequent itemset mining from a large transactional database is a very time consuming process. A famous frequent pattern mining algorithm is Apriori. Apriori algorithm generates a frequent itemsets in loop manner, one ...

Data mining techniques are applied usually to uncover concealed knowledge from massive data stacked up in databases. One of the potential fields of Data mining application is healthcare systems in which the increasingly ...

This research paper intends to provide comparative analysis of Data Mining classification algorithms. Some benchmarking classification algorithms like Naïve Bayes, Bayesian Network, JRip, OneR and PART are selected based ...