M. Oboudi

activity

20092024

most citedTrung's Construction and the Charney-Davis Conjecture

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

collaborators

Showing 2019 · math.COShow all

2 papers · 2 filters

math.CO2019★ 3 cited

Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four

Mohammad Reza Oboudi, Ashkan Nikseresht

Let $α = α (G)$ be the independence number of a simple graph $G$ with $n$ vertices and $I (G)$ be its edge ideal in $S = K [x_{1}, \dots, x_{n}]$ . If $S / I (G)$ is Gorenstein, the graph $G$ is…

math.CO2019★ 1 cited

Laplacian Spectral Determination of Path-Friendship Graphs

A. Z. Abdian, A. R. Ashrafi, L. W. Beineke +1

A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$ . van Dam and Haemers (2003) conjecture…