Zobrazeno 1 - 10
of 35
pro vyhledávání: '"王道明"'
Publikováno v:
Journal of Drainage & Irrigation Machinery Engineering / Paiguan Jixie Gongcheng Xuebao; 2019, Vol. 37 Issue 7, p587-592, 6p
Autor:
Tao-Ming Wang, 王道明
102
Energy crisis and environmental protection have been the most important issues these days. Many countries had already set up relevant legislations to achieve the goal of zero-emission and to decrease the fuel consumption. However, there is s
Energy crisis and environmental protection have been the most important issues these days. Many countries had already set up relevant legislations to achieve the goal of zero-emission and to decrease the fuel consumption. However, there is s
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/84bf82
Publikováno v:
China Sciencepaper; 2016, Vol. 11 Issue 16, p1840-1849, 5p
Autor:
LIU, REN-HAO, 劉人豪
107
For an undirected graph G, let E(v) denote the set of edges incident on a vertex v ∈ V(G). A zero-sum flow is an assignment of non-zero integers to the edges such that the sum of the values v of all edges incident with each vertex is zero.
For an undirected graph G, let E(v) denote the set of edges incident on a vertex v ∈ V(G). A zero-sum flow is an assignment of non-zero integers to the edges such that the sum of the values v of all edges incident with each vertex is zero.
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/e29nfq
Autor:
Chih-Hsiuan Liu, 劉志璿
106
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. A finite simple graph G = (V,E) is called (a,d)edge-antimagic if there exists an injective vertex labeling function f : V → {1
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. A finite simple graph G = (V,E) is called (a,d)edge-antimagic if there exists an injective vertex labeling function f : V → {1
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/xt8hwj