S. Mehry

activity

20152026

most citedThree domination number and connectivity in graphs

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

collaborators

5 papers

math.CO2026

Intersection Orbital Graphs of Permutation Groups and Reconstruction of Simple Groups

Shahram Mehry

We introduce the \emph{intersection orbital graph} $Γ (G_{1}, G_{2}; Ω)$ associated with two permutation groups $G_{1}, G_{2} \leq Sym (Ω)$ on a finite set $Ω$ .

math.CO2025

A Bipartite Graph Linking Units and Zero-Divisors

Shahram Mehry, Ali Eisapoor Khasadan

Let $R$ be a commutative ring with identity. We introduce a novel bipartite graph $B (R)$ , the \textit{bipartite zero-divisor--unit graph}, whose vertex set is the disjoin…

math.CO2025

The Homomorphism Submodule Graph

Shahram Mehry, Mansour Molaeinejad

Let $M$ be a left $R$ -module. We define the \emph{homomorphism submodule graph} $Γ_{Hom} (M)$ as the simple graph whose vertices are the proper submodules of $M$ , with an e…

math.CO2025

Directed Hamiltonicity in Generalized Kneser Graphs

Shahram Mehry

We prove that the canonical orientation of the generalized Kneser graph $K G (n, k, s)$ contains a directed Hamiltonian cycle for all integers $s \geq 3$ and $n > s k$ . Furthermore, we es…

math.CO2015★ 1 cited

Three domination number and connectivity in graphs

S. Mehry, R. Safakish

In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V is dominated by at least one vertex in S. The domina…