Bulletin of Computational Applied Mathematics

12

Authors: Nima Ghanbari, Saeid Alikhani

Let G be a simple graph. A total dominator coloring of G is a proper coloring of the vertices of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number Xtd(G)of G is the minimum number of colors among all total dominator coloring of G. In this paper, we examine the effects on Xtd(G) when G is modified by operations on vertex and edge of G.

20

Authors: Anna Formica

"Formal Concept Analysis" and "Rough Set Theory" provide two mathematical frameworks in information management which have been developed almost independently in the past. Currently, their integration is revealing very interesting in different research fields, such as knowledge discovery, data mining, information retrieval, elearning, and ontology engineering. In this paper, we show how "Rough Set Theory" can be employed in combination with a generalization of "Formal Concept Analysis" for modeling uncertainty information ("Fuzzy Formal Concept Analysis") to perform Semantic Web search. In particular this paper presents an updated evaluation of a previous proposal of the author which has been addressed because of the increasing interest in this topic and, at the same time, the absence in the literature of significant proposals combining these two frameworks.

25

Authors: Naveed Yaqoob, Muhammad Akram

In this research article, we introduce the notion of complex neutrosophic graphs (cn-graphs, for short) and discuss some basic operations related to cn-graphs. We describe these operations with some examples. We also present energy of complex neutrosophic graphs.