Artículos de revistas
The splitting number and skewness of C-n x C-m
Registro en:
Ars Combinatoria. Charles Babbage Res Ctr, v. 63, n. 193, n. 205, 2002.
0381-7032
WOS:000175279500017
Autor
Neto, CFXD
Schaffer, K
Xavier, EF
Stolfi, J
Faria, L
de Figueiredo, CMH
Institución
Resumen
The skewness of a graph G is the minimum number of edges that need to be deleted from G to produce a planar graph. The splitting number of a graph G is the minimum number of splitting steps needed to turn G into a planar graphs where each step replaces some of the edges (u, v) incident to a selected vertex u by edges (u', v), where u' is a new vertex. V,e show that the splitting number of the toroidal grid graph C-n x C-m is min(n, m) - 2delta(n-3)delta(m,3) - delta(n,4)delta(m,3) - delta(n,3)delta(m,4) and its skewness is min(n, m) - delta(n,3)delta(m,3) - delta(n,4)delta(m,3) - delta(n,3)delta(m,4). Here, delta is the Kronecker symbol, i.e., delta(i,j) is 1 if i = j, and 0 if i not equal j. 63 193 205