Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nan-Hua Jhuang"'
Autor:
Nan-Hua Jhuang, 莊枏樺
99
Let G = (V,E) be a connected simple graph and A a nontrivial Abelian group with identity 0. A mapping f : E → A{0} is called an edge labeling of G. Any such labeling f induces a mapping f +:V → A, defined by f +(v) = for each v in V. If t
Let G = (V,E) be a connected simple graph and A a nontrivial Abelian group with identity 0. A mapping f : E → A{0} is called an edge labeling of G. Any such labeling f induces a mapping f +:V → A, defined by f +(v) = for each v in V. If t
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/55303522558053397177
Autor:
Nan-Hua Jhuang, 莊柟樺
89
A graph is to be a complete graph Kn if the graph has n points and there is an edge joining any two points. A complete n-partite graph is a graph with n partite sets,m1,m2,….,mn points, respectively. There is an edge joining any two points
A graph is to be a complete graph Kn if the graph has n points and there is an edge joining any two points. A complete n-partite graph is a graph with n partite sets,m1,m2,….,mn points, respectively. There is an edge joining any two points
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/66192473605331060289
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