Saieed Akbari

collaborators

4 papers

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★ 3 cited

The Domination Polynomials of Cubic graphs of order 10

Saieed Akbari, Saeid Alikhani, Yee-hock Peng

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=\sum_{i=γ(G)}^{n} d(G,i) x^{i}, where d(G,i) is the number of dominating sets of G of si…

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.

math.CO2007

Some Relations between Rank, Chromatic Number and Energy of Graphs

S. Akbari, E. Ghorbani, S. Zare

The energy of a graph $G$ , denoted by $E (G)$ , is defined as the sum of the absolute values of all eigenvalues of $G$ . Let $G$ be a graph of order $n$ and $rank (G)$ be the ran…