The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known that every planar graph G has a strong edge-coloring with at most 4 Δ(G) + 4 colors [R.J. Faudree, A. Gyárfás, R.H. Schelp and Zs. Tuza, The strong chromatic index of graphs, Ars Combin. 29B (1990) 205–211]. In this paper, we show that if G is...
This paper concerns the synchronization of time-delayed systems with periodic on-off coupling. Based on the stability theory and the comparison theorem of time-delayed differential equations, sufficient conditions for complete synchronization of systems with constant delay and time-varying delay are established. Compared with the results based on the Krasovskii-Lyapunov method, the sufficient conditions established in this paper are less restrictive. The theoretical results show that two time-delayed...
Download Results (CSV)