At its 18th National Congress the Communist Party of China presented a roadmap and issued the call to achieve the Two Centennial Goals: successful completion of the process of building a moderately well-off soeiety; a...At its 18th National Congress the Communist Party of China presented a roadmap and issued the call to achieve the Two Centennial Goals: successful completion of the process of building a moderately well-off soeiety; and aeeelerated socialist modernization. Specifically, this means doubling China's aolo GDP and per eapita ineome of both urban and rural residents by 2021, when the CPC celebrates its centenary.展开更多
A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that ...A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D,and the set V(G)\D is independent.The 2-domination(total outer-independent domination,respectively)number of a graph G is the minimum cardinality of a 2-dominating(total outer-independent dominating,respectively)set of G.We investigate the ratio between2-domination and total outer-independent domination numbers of trees.展开更多
文摘At its 18th National Congress the Communist Party of China presented a roadmap and issued the call to achieve the Two Centennial Goals: successful completion of the process of building a moderately well-off soeiety; and aeeelerated socialist modernization. Specifically, this means doubling China's aolo GDP and per eapita ineome of both urban and rural residents by 2021, when the CPC celebrates its centenary.
基金the Polish Ministry of Science and Higher Education grand IP/2012/038972
文摘A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D,and the set V(G)\D is independent.The 2-domination(total outer-independent domination,respectively)number of a graph G is the minimum cardinality of a 2-dominating(total outer-independent dominating,respectively)set of G.We investigate the ratio between2-domination and total outer-independent domination numbers of trees.
