Moharram N. Iradmusa

activity

20082024

most citedSimultaneous coloring of vertices and incidences of graphs

2 citations · 2 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2024

Derangement Representation of Graphs

Somayeh Ashofteh, Moharram N. Iradmusa

A derangement $k$ -representation of a graph $G$ is a map $π$ of $V (G)$ to the symmetric group $S_{k}$ , such that for any two vertices $v$ and $u$ of $V (G)$ , $v$ and $u$ are adjacent…

math.CO2022

Simultaneous coloring of vertices and incidences of Outerplanar graphs

Mahsa Mozafari-Nia, Moharram N. Iradmusa

A $v i$ -simultaneous proper $k$ -coloring of a graph $G$ is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set $V(G)\cup…

math.CO2022★ 2 cited

Simultaneous coloring of vertices and incidences of graphs

Mahsa Mozafari-Nia, Moharram N. Iradmusa

An $n$ -subdivision of a graph $G$ is a graph constructed by replacing a path of length $n$ instead of each edge of $G$ and an $m$ -power of $G$ is a graph with the same vertices as…

math.CO2021

Counterexamples to a conjecture on matching Kneser graphs

Moharram N. Iradmusa

Let $G$ be a graph and $r \in N$ . The matching Kneser graph $KG (G, r K_{2})$ is a graph whose vertex set is the set of $r$ -matchings in $G$ and two vertices are adjace…

math.CO2019

Generating infinite digraphs by derangements

Daniel Horsley, Moharram Iradmusa, Cheryl E. Praeger

A set $S$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x, x^{σ})$ for $x \in V$ and $σ \in S$ . We a…

math.CO2018

Derangement action digraphs and graphs

Moharram N. Iradmusa, Cheryl E. Praeger

We study the family of \emph{derangement action digraphs}, which are a subfamily of the group action graphs introduced in [Fred Annexstein, Marc Baumslag, and Arnold L. Rosenberg,…