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 math.COShow all

8 papers · 1 filter

math.CO2024

On the number of connected edge cover sets in a graph

Mahsa Zare, Saeid Alikhani, Mohammad Reza Oboudi

Let $G = (V, E)$ be a simple graph of order $n$ and size $m$ . A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to a…

math.CO2020

Universal spectra of the disjoint union of regular graphs

Willem H. Haemers, Mohammad Reza Oboudi

A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = α A + β I + γ J + δ D$ with $α \neq = 0$ , where $I$ is the identity matrix, $J$ is the…

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…

math.CO2013★ 3 cited

Graphs cospectral with a friendship graph or its complement

Alireza Abdollahi, Shahrooz Janbaz, Mohammad Reza Oboudi

Let $n$ be any positive integer and let $F_{n}$ be the friendship (or Dutch windmill) graph with $2 n + 1$ vertices and $3 n$ edges. Here we study graphs with the same adjacency spectrum…

math.CO2013★ 3 cited

On the largest real root of independence polynomials of graphs, an ordering on graphs, and starlike trees

Mohammad Reza Oboudi

Let $G$ be a simple graph of order $n$ . An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of $G$ is the polynomial $I(G,x)=\sum_…