M. Oboudi

most citedCycles are determined by their domination polynomials

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2009★ 3 cited

Cycles are determined by their domination polynomials

Saieed Akbari, Mohammad Reza Oboudi

Let $G$ be a simple graph of order $n$ . A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$ . The dom…

math.CO2009★ 2 cited

A conjecture on square roots of Laplacian and signless Laplacian eigenvalues of graphs

S. Akbari, E. Ghorbani, M. R. Oboudi

We conjecture that the sum of the square roots of the Laplacian eigenvalues of a graph does not exceed the sum of the square roots of its signless Laplacian eigenvalues.