Browsing by Author "Farahani, Moahmmad Reza"

Now showing 1 - 3 of 3

Fuzzy Stability in the Sense of Hyers-Ulam of a Functional Equation on Quadratic Forms
(Taru Publications, 2023) Farahani, Moahmmad Reza; Valdes, Juan E. Napoles; Cancan, Murat; Jafari, Saeid
We obtain a general solution of the 2-variable quadratic functional equation zeta(y(1) + y(2), y(3) + y(4)) + zeta(y(1)-y(2), y(3)-y(4)) = 2 zeta(y(1), y(3)) + 2 zeta(y(2), y(4)) and discuss the stability of the above functional equation, while the quadratic form zeta(a, b) = alpha a(2) + beta ab + gamma c(2) is a solution of our functional equation.
On Sombor Indices of Line Graph of Silicate Carbide Si2c3-I[p,q]
(Taylor & Francis Ltd, 2022) Asif, Fatima; Zahid, Zohaib; Husin, Mohamad Nazri; Cancan, Murat; Tas, Ziyattin; Alaeiyan, Mehdi; Farahani, Moahmmad Reza
Topological indices are numerical parameters associated with underlying topology of a molecular structure. They are correlated with several physio-chemical properties of chemical compounds. Recently, Euclidean metric based topological index has been introduced named as Sombor index. Therefore, in this article, we will discuss combinatorial aspects and compute Sombor index, average Sombor index and the reduced Sombor index of line graph of silicate carbides Si2C3-I[p, q].
The Study of the B-Choromatic Number of Some Classes of Fractal Graphs
(Taru Publications, 2022) Sattar, Tayyiba; Sardar, Muhammad Shoaib; Alaeiyan, Mehdi; Farahani, Moahmmad Reza; Cancan, Murat; Tas, Ziyattin
In graph coloring, labels are assigned to graph elements according to certain constraints. Colors are a special case of graph labeling as well as in practical applications, graph coloring also poses some theoretical challenges. A topic related to graph coloring will be discussed in this study, i.e., b-chromatic number. In proper coloring, edges, vertices, or both of them are colored so that they are distinct from one another. A b-coloring of m colors of a graph G is similar to proper coloring in which at least one vertex from each color class is connected to (m-1) other colors. The b-chromatic number of a graph G is the greatest positive number k such that G admits a b-coloring with k colors and is represented by phi(G). Fractals are geometric objects that are self-similar at multiple scales and their geometric measurements are different from fractal measurements. In this paper, we will evaluate the b-chromatic number of Fractal type graphs, i.e., Sierpinski network S(n; Kk) (where Kk is a complete graph of order k) and Sierpinski gasket network S(n). Firstly, we will compute the b-chromatic number of S(n; K3), S(n; K4) and S(n; K5) for n >= 2. After that, we will generalize the result for the Sierpinski network of complete graph Kk. In addition, we will also determine the b-choromatic number of Sierpinski gasket graph S(n). As an application, we will also determine the b-chromatic number of Sierpinski graph of house graph.