S. R. Musawi

activity

20182024

most cited2-nearly Platonic graphs are unique

1 citations · 1 across the 3 of their papers we have counts for

collaborators

8 papers

math.CO2024

Further Results on the Majority Roman Domination in graphs

Azam Sadat Emadi, Iman Masoumi, Seyed Reza Musawi

Let $G = (V, E)$ be a simple graph of order $n$ . A Majority Roman Dominating Function (MRDF) on a graph G is a function $f : V \to {- 1, + 1, 2}$ if the sum of its function value…

math.CO2019★ 1 cited

2-nearly Platonic graphs are unique

D. Froncek, M. R. Khorsandi, S. R. Musawi +1

A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f-2 of which are of degree d and the remaining two are of degrees m_1;m_2, both different from d.…

math.CO2019

A note on nearly Platonic graphs with connectivity one

D. Froncek, M. R. Khorsandi, S. R. Musawi +1

A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with conn…

math.CO2019

Absence of $1$ -Nearly Platonic Graphs

Mahdi Reza Khorsandi, Seyed Reza Musawi

A $t$ -nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly $t$ numbers of its faces have the same length. It is proved that there…

math.CO2018

Domination Critical Knodel Graphs

D. A. Mojdeh, S. R. Musawi, E. Nazari

A set $D$ of vertices of a graph $G$ is a dominating set if each vertex of $V (G) ∖ D$ is adjacent to some vertex of $D$ . The domination number of $G$ , $γ (G)$ , is the minimum…