M. F. D. Ghouchan

activity

20142025

most citedToroidal and projective commuting and non-commuting graphs

10 citations · 19 across the 18 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2025

Positive matching decompositions of the cartesian product of graphs

Mohammad Farrokhi Derakhshandeh Ghouchan, Ali Akbar Yazdan Pour

Let $Γ = (V, E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges w…

math.CO2023

Explicit formulas for matrices associated to ladder, circular ladder, and Mobius ladder graphs

Ali Azimi, Mohammad Farrokhi Derakhshandeh Ghouchan

We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of incidence and Laplacian matrices of ladder, circular ladder, and Möbius ladder graphs. As a…

math.CO2023

Moore-Penrose inverse of incidence matrices

Ali Azimi, R. B. Bapat, Mohammad Farrokhi Derakhshandeh Ghouchan

We present explicit formulas for Moore-Penrose inverses of some families of set inclusion matrices arising from sets, vector spaces, and designs.

math.CO2022

Fully reducible simple Venn diagrams

Mohammad Farrokhi Derakhshandeh Ghouchan

We generalize Venn diagrams in spaces of arbitrary dimension $\geq 2$ and study simple Venn diagrams with the reducing property. Three equivalent conditions for a simple Venn diagr…

math.CO2021

Positive matching decompositions of graphs

Mohammad Farrokhi Derakhshandeh Ghouchan, Shekoofeh Gharakhloo, Ali Akbar Yazdan Pour

A matching $M$ in a graph $Γ$ is positive if $Γ$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd)…

math.CO2019

Lattice paths inside a table: Rows and columns linear combinations

Mohammad Farrokhi Derakhshandeh Ghouchan

A lattice path inside the $m \times n$ table $T$ is a sequence $ν_{1}, \dots, ν_{k}$ of cells such that $ν_{j + 1} - ν_{j} \in {(1, - 1), (1, 0), (1, 1)}$ for all $j = 1, \dots, k - 1$ . The number of lat…

math.CO2019

Some Algebraic Properties of Sierpiński-Type Graphs

Mohammad Farrokhi Derakhshandeh Ghouchan, E. Ghorbani, H. R. Maimani +1

This paper deals with some of the algebraic properties of Sierpiński graphs and a family of regular generalized Sierpiński graphs. For the family of regular generalized Sierpiński…

math.CO2016

A characterization of Tutte-Coxeter graph

Mohammad Farrokhi Derakhshandeh Ghouchan, Abbas Mohammadian

We give a natural generalization of the Tutte-Coxeter graph in a natural way and prove that the Tutte-Coxeter graph is the only vertex-transitive (edge-transitive) graph among all…