Ground level ozone pollution has become a significant air pollution problem in Beijing. Because of the complex way in which ozone is formed, it is difficult for policy makers to identify optimal control options on a c...Ground level ozone pollution has become a significant air pollution problem in Beijing. Because of the complex way in which ozone is formed, it is difficult for policy makers to identify optimal control options on a cost-effective basis. This paper identi-fies and assesses a range of options for addressing this problem. We apply the Ambient Least Cost Model and compare the eco-nomic costs of control options, then recommend the most effective sequence to realize pollution control at the lowest cost. The study finds that installing of Stage II gasoline vapor recovery system at Beijing's 1446 gasoline stations would be the most cost-effective option. Overall, options to reduce ozone pollution by cutting ve-hicular emissions are much more cost-effective than options to "clean up" coal-fired power plants.展开更多
A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong ed...A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x'as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △A(G)≥5.展开更多
A k-adjacent strong edge coloring of graph G(V, E) is defined as a proper k-edge coloring f of graph G(V, E) such that f[u] ≠ f[v] for every uv ∈ E(G), where f[u] = {f(uw)|uw ∈ E(G)} and f(uw) denotes the color of ...A k-adjacent strong edge coloring of graph G(V, E) is defined as a proper k-edge coloring f of graph G(V, E) such that f[u] ≠ f[v] for every uv ∈ E(G), where f[u] = {f(uw)|uw ∈ E(G)} and f(uw) denotes the color of uw, and the adjacent strong edge chromatic number is defined as x'as(G) = min{k| there is a k-adjacent strong edge coloring of G}. In this paper, it has been proved that △ ≤ x'as(G) ≤ △ + 1 for outer plane graphs with △(G) ≥ 5, and X'as(G) = △ + 1 if and only if there exist adjacent vertices with maximum degree.展开更多
基金supported by the Economyand Environment Program for Southeast Asia (EEPSEA)Beijing Science and Technology Commission (GrantNo.D09040903670905)+1 种基金Study on the Regional Air PollutionControl Strategy and PolicyShanghai Tongji Gao Tingyao Environmental Science and Technology Development Foundation
文摘Ground level ozone pollution has become a significant air pollution problem in Beijing. Because of the complex way in which ozone is formed, it is difficult for policy makers to identify optimal control options on a cost-effective basis. This paper identi-fies and assesses a range of options for addressing this problem. We apply the Ambient Least Cost Model and compare the eco-nomic costs of control options, then recommend the most effective sequence to realize pollution control at the lowest cost. The study finds that installing of Stage II gasoline vapor recovery system at Beijing's 1446 gasoline stations would be the most cost-effective option. Overall, options to reduce ozone pollution by cutting ve-hicular emissions are much more cost-effective than options to "clean up" coal-fired power plants.
基金Supported by NNSFC(19871036)"Qing Lan"talent funds of Lanzhou Railway Institute.
文摘A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x'as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △A(G)≥5.
基金National Natural Science Foundation of China (No. 19871036) Qinglan talent Funds of Lanzhou Jiaotong University.
文摘A k-adjacent strong edge coloring of graph G(V, E) is defined as a proper k-edge coloring f of graph G(V, E) such that f[u] ≠ f[v] for every uv ∈ E(G), where f[u] = {f(uw)|uw ∈ E(G)} and f(uw) denotes the color of uw, and the adjacent strong edge chromatic number is defined as x'as(G) = min{k| there is a k-adjacent strong edge coloring of G}. In this paper, it has been proved that △ ≤ x'as(G) ≤ △ + 1 for outer plane graphs with △(G) ≥ 5, and X'as(G) = △ + 1 if and only if there exist adjacent vertices with maximum degree.
