Jiang Yongsong

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let (G) be the domination number of graph G, thus a graph G is k -edge-critical if (G) 1⁄4 k ; and for every nonadjacent pair of vertices u and v, (Gþ uv) 1⁄4 k 1. In Chapter 16 of the book ‘‘Domination in Graphs— Advanced Topics,’’ D. Sumner cites a conjecture of E. Wojcicka under the form ‘‘3-connected 4-critical graphs are Hamiltonian and perhaps, in(More)
This paper presents the extension of the global description approach of a discontinuous function, which is proposed in the previous paper, to a spectral domain decomposition method. This multi-domain spectral immersed interface method(IIM) divides the whole computation domain into the smooth and discontinuous parts. Fewer points on the smooth domains are(More)
  • 1