6 citations · 22 across the 9 of their papers we have counts for
10 papers
On the number of connected edge cover sets in a graph
Mahsa Zare, Saeid Alikhani, Mohammad Reza Oboudi
Let be a simple graph of order and size . A connected edge cover set of a graph is a subset of edges such that every vertex of the graph is incident to a…
Universal spectra of the disjoint union of regular graphs
Willem H. Haemers, Mohammad Reza Oboudi
A universal adjacency matrix of a graph with adjacency matrix is any matrix of the form with , where is the identity matrix, is the…
Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four
Mohammad Reza Oboudi, Ashkan Nikseresht
Let be the independence number of a simple graph with vertices and be its edge ideal in . If is Gorenstein, the graph is…
On Gorenstein Circulant Graphs and Gorenstein SQC Graphs
Ashkan Nikseresht, Mohammad Reza Oboudi
We characterize some graphs with a Gorenstein edge ideal. In particular, we show that if is a circulant graph with vertex degree at most four or a circulant graph of the form $…
Trung's Construction and the Charney-Davis Conjecture
Ashkan Nikseresht, Mohammad Reza Oboudi
We consider a construction by which we obtain a simple graph from a simple graph and a non-isolated vertex of . We call this construction "Trung's cons…
Laplacian Spectral Determination of Path-Friendship Graphs
A. Z. Abdian, A. R. Ashrafi, L. W. Beineke +1
A graph is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to . van Dam and Haemers (2003) conjecture…