3 citations · 7 across the 11 of their papers we have counts for
13 papers
Further Results on the Majority Roman Domination in graphs
Azam Sadat Emadi, Iman Masoumi, Seyed Reza Musawi
Let be a simple graph of order . A Majority Roman Dominating Function (MRDF) on a graph G is a function if the sum of its function value…
Diameter of 2-distance graphs
S. H. Jafari, S. R. Musawi
For a simple graph , the -distance graph, , is a graph with the vertex set and two vertices are adjacent if and only if their distance is in the graph .…
Connectivity of -distance graphs
S. R. Musawi, S. H. Jafari
For a simple graph , the -distance graph, , is a graph with the vertex set and two vertices are adjacent if and only if their distance is in the graph .…
Connectivity of 2-distance graphs
S. H. Jafari, S. R. Musawi
For a simple graph , the -distance graph, , is a graph with the vertex set and two vertices are adjacent if and only if their distance is in the graph .…
Diameter of General Knödel Graphs
Seyed Reza Musawi, Esameil Nazari Kiashi
The Knödel graph is a -regular bipartition graph on vertices and is an even integer. The vertices of are the pairs with and $0…
On the nonorientable genus of the generalized unit and unitary Cayley graphs of a commutative ring
Mahdi Reza Khorsandi, Seyed Reza Musawi
Let be a commutative ring and let be multiplicative group of unit elements of . In 2012, Khashyarmanesh et al. defined generalized unit and unitary Cayley graph, $Γ(R…
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.…
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…
Absence of -Nearly Platonic Graphs
Mahdi Reza Khorsandi, Seyed Reza Musawi
A -nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly numbers of its faces have the same length. It is proved that there…
Domination Critical Knodel Graphs
D. A. Mojdeh, S. R. Musawi, E. Nazari
A set of vertices of a graph is a dominating set if each vertex of is adjacent to some vertex of . The domination number of , , is the minimum…
On the distance domination number of bipartite graphs
D. A. Mojdeh, S. R. Musawi, E. Nazari
A subset is called a -distance dominating set of if every vertex in is within distance from some vertex of . The minimum cardinali…
Domination in 4-regular Knödel graphs
Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari
A subset of vertices of a graph is a dominating set if for each , is adjacent to some vertex . The domination number, of , is th…
Total domination in cubic Knödel graphs
Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari +1
A subset of vertices of a graph is a \textit{dominating set} if for each , is adjacent to some vertex . The \textit{dominating number}, $γ…