M. Anwar

collaborators

5 papers

math.NT2022

On the diophantaine equations $J_{N} + J_{M} = F_{A}$ & $F_{N} + F_{M} = J_{A}$

Seif Tarek, Ahmed Gaber, M. Anwar

Let ${F_{k}}_{k \geq 0}$ be the Fibonacci sequence defined by $F_{k} = F_{F - 1} + F_{k - 2}$ for all $n \geq 2$ with initials $F_{0} = 0 F_{1} = 1$ . Let $\left\lbrace J…

math.CO2022

New bounds on the number of Edges of the maximal Permutation Graphs

M. Anwar, Mahmoud Tarek, Ahmed Gaber

In this paper, we bound the number of edges of a maximal permutation graph with n vertices. We propose a new method to compute the lower bound by splitting the set of labellings of…

math.CO2022

Some Difference Graphs

M. A. Seoud, M. M. Farid, M. Anwar

In this paper, we discuss difference labeling of some standard families of graphs. We prove that Star, Butterfly, Bistar, umbrella and Olive tree are difference graphs. We also int…

math.NT2022

Padovan and Perrin Numbers as Sums of Two Jacobsthal Numbers

Mustafa Ismail, Ahmed Gaber, M. Anwar

Let ${P_{k}}_{k \geq 0}$ be the Padovan sequence defined by $P_{k} = P_{k - 2} + P_{k - 3}$ with initial values are $P_{0} = P_{1} = P_{2} = 1$ . Let $\left\lbrace R_{k}\rig…

math.NT2022

Narayana Sequence and The Brocard-Ramanujan Equation

Mustafa Ismail, Salah Rihanaa, M. Anwar

Let ${a_{n}}_{n \geq 0}$ be the Narayana Sequence defined by the recurence $a_{n} = a_{n - 1} + a_{n - 3}$ for all $n \geq 3$ with intital values $a_{0} = 0$ and $a_{1}…

On the diophantaine equations JN​+JM​=FA​ & FN​+FM​=JA​

New bounds on the number of Edges of the maximal Permutation Graphs

Some Difference Graphs

Padovan and Perrin Numbers as Sums of Two Jacobsthal Numbers

Narayana Sequence and The Brocard-Ramanujan Equation

On the diophantaine equations $J_{N} + J_{M} = F_{A}$ & $F_{N} + F_{M} = J_{A}$