#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Saieed Akbari, Maryam Ghanbari, S. Jahanbekam
- Discrete Applied Mathematics
- 2009

A proper vertex coloring of a graph G is called a dynamic coloring if for every vertex v of degree at least 2, the neighbors of v receive at least two different colors. Assume that ch2(G) is the minimum number k such that for every list assignment of size k to each vertex of G, there is a dynamic coloring of G such that every vertex is colored with a color… (More)

- Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr
- Electr. J. Comb.
- 1992

Let G be a graph. The core of G, denoted by G∆, is the subgraph of G induced by the vertices of degree ∆(G), where ∆(G) denotes the maximum degree of G. A k-edge coloring of G is a function f : E(G)→ L such that |L| = k and f(e1) 6= f(e2) for all two adjacent edges e1 and e2 of G. The chromatic index of G, denoted by χ′(G), is the minimum number k for which… (More)

- Saieed Akbari, Maryam Ghanbari, R. Manaviyat, Sanaz Zare
- Graphs and Combinatorics
- 2013

In this paper, we consider variational iteration method (VIM) to obtain exact solution to the Fisher’s equation. The variational iteration method is based on Lagrange multipliers for identification of optimal value of parameters in a functional. Using this method, it is possible to find the exact solution or an approximate solution of the problem.

- Saieed Akbari, David Cariolaro, M. Chavooshi, Maryam Ghanbari, Sanaz Zare
- Discrete Mathematics
- 2012

- Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari
- Discrete Mathematics
- 2012

- Saieed Akbari, Maryam Ghanbari, S. Jahanbekam, M. Jamaali
- Discrete Mathematics
- 2009

In this paper, by considering the variational iteration method, a kind of explicit exact and numerical solutions to the Lienard equation is obtained, and the numerical solutions has been compared with their known theoretical solution. The variational iteration method is based on Lagrange multipliers for identification of optimal value of parameters in a… (More)

- Saieed Akbari, Maryam Ghanbari, Kenta Ozeki
- Graphs and Combinatorics
- 2015

Let G be a graph. The core of G, denoted by G , is the subgraph of G induced by the vertices of degree (G), where (G) denotes the maximum degree of G. A k-edge coloring of G is a function f : E(G) → L such that |L| = k and f (e1) = f (e2), for any two adjacent edges e1 and e2 of G. The chromatic index of G, denoted by χ ′(G), is the minimum number k for… (More)

- Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr
- Graphs and Combinatorics
- 2014