Maryam Ghanbari

Learn More
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)
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)
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)
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)