Masoumeh Golmohamadian

Masoumeh Golmohamadian
Tarbiat Modares University | TMU · Department of Pure Mathematics

About

11
Publications
1,006
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
25
Citations
Introduction
Mathematical Epidemiology, Infectious Disease Modeling

Publications

Publications (11)
Article
Infectious diseases are transmitted from one person to another and spread throughout a network under certain conditions. Considering an example of propagation, we explain how to define an automaton on the network according to the propagation steps and the conditions under which the epidemic is transmitted. We call this automaton forcing automaton....
Article
In this paper, we investigate the fuzzfi�cation of zero forcing process. For this, f�irst we introduce a new embedding of a graph G by considering a minimal zero forcing set of G and an arbitrary list of maximal forcing chains of this zero forcing set. Then we get a comparing between zero forcing sets of a graph by using fuzzy concepts. Finally, we...
Article
Full-text available
A zero forcing set is a new concept in Graph Theory which was introduced in recent years. In this paper, we investigate the relationship between zero forcing sets and algebraic hyperstructures. To this end, we present some new definitions by considering a zero forcing process on a graph G. These definitions help us analyze the zero forcing process...
Conference Paper
Full-text available
In this paper, we expand the research on making relationships between graphs and hyperstructures. First, by considering an arbitrary zero forcing set Z on a graph G and it's forcing process, we define zero forcing roots and zero forcing leaves of one vertex. These new definitions provide the opportunity for us to introduce two commutative hypergrou...
Conference Paper
Full-text available
There is a new concept in graph theory which is called a zero forcing set. The zero forcing set has been defined in recent years and has many applications in different sciences. In present paper, by properties of zero forcing sets, we define two hypergroups and two join spaces on the vertex set of a graph.
Conference Paper
Full-text available
In present study, we investigate the relation of dominating sets in graphs and hyperstructures. We introduce different hyperoperations and semihypergroups, deriving from dominating sets and minimal dominating sets of a graph and we examine their properties.
Article
Full-text available
In this paper, some new classes of hyperoperations, extracting from the vertex coloring of a graph, are presented. By these hyperoperations, we define a color hypergroup and a color join space on the vertex set of a graph. Also we give some examples to clarify these structures. Finally, we investigate the connection between the color join space and...
Conference Paper
Full-text available
The relationship between various branches of mathematics and interlinking characteristics of them has always been a topic of interest for mathematicians. In the present paper, first, we define a color hypergroup and a color join space on the vertex set of a graph by considering the concept of vertex coloring of a graph. Then we introduce a hyper K-...
Article
Full-text available
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is sho...
Article
Full-text available
In this note first we define a hyper K-algebra S on the states of a deter-ministic finite automaton. Then we obtain some commutative hyper K-ideals of types 3, 4, 5, 6 and 9 and also positive implicative hyper K-ideals of types 1, 2, 3, 4, 5, 6, 7, 8 and 9 of S. Also we prove some theorems and obtain some results, to show that some properties of th...
Article
Full-text available
In this note first we define a BCK-algebra on the states of a deterministic finite automaton. Then we show that it is a BCK-algebra with condition (S) and also it is a positive implicative BCK-algebra. Then we find some quotient BCK-algebras of it. After that we introduce a hyper BCK-algebra on the set of all equivalence classes of an equivalence r...

Network

Cited By