Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hsiao-ming Sung"'
Autor:
Hsiao-Ming Sung, 宋曉明
100
A complete graph with v vertices, denoted by Kv, is a simple graph whose vertices are mutually adjacent. A complete bipartite graph is a graph G = (V,E) where V can be divided into two disjoint sets V1 and V2 and E contains all edges connect
A complete graph with v vertices, denoted by Kv, is a simple graph whose vertices are mutually adjacent. A complete bipartite graph is a graph G = (V,E) where V can be divided into two disjoint sets V1 and V2 and E contains all edges connect
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/69598816018872188733
Autor:
Hsiao-ming Sung, 宋曉明
92
In this paper, first, we use the division algorithm in k[x_1,…x_n] to introduce Gröbner basis, some of its properties and some applications. Then we use these tools to construct the standard steps of automatic geometric theorem proving. In
In this paper, first, we use the division algorithm in k[x_1,…x_n] to introduce Gröbner basis, some of its properties and some applications. Then we use these tools to construct the standard steps of automatic geometric theorem proving. In
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/99026639641926270097
Publikováno v:
Taiwanese J. Math. 16, no. 2 (2012), 531-543
An $n$-$sun$ is the graph with $2n$ vertices consisting of an $n$-cycle with $n$ pendent edges which form a 1-factor. In this paper we show that the necessary and sufficient conditions for the decomposition of complete tripartite graphs with at least
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24cd5cf86cb4b64bc262b66937c45984
http://projecteuclid.org/euclid.twjm/1500406600
http://projecteuclid.org/euclid.twjm/1500406600