A Planar graph g is called a ipseudo outerplanar graph if there is a subset v.∈V(G),[V.]=i,such that G-V. is an outerplanar graph in particular when G-V.is a forest ,g is called a i-pseudo-tree .in this paper.the fol...A Planar graph g is called a ipseudo outerplanar graph if there is a subset v.∈V(G),[V.]=i,such that G-V. is an outerplanar graph in particular when G-V.is a forest ,g is called a i-pseudo-tree .in this paper.the following results are proved;(1)the conjecture on the total coloring is true for all 1-pseudo-outerplanar graphs;(2)X1(G)+1 fo any 1-pseudo outerplanar graph g with △(G)≥3,where x4(G)is the total chromatic number of a graph g.展开更多
A class of superprocesses which dies out is investigated.Under the condition of norextinction, a new superprocess is constructed,its life time is infinite, and its distribution is determined by the moment function. Se...A class of superprocesses which dies out is investigated.Under the condition of norextinction, a new superprocess is constructed,its life time is infinite, and its distribution is determined by the moment function. Several limit theorems about this superprocess and its occupation time process are obtained.展开更多
文摘A Planar graph g is called a ipseudo outerplanar graph if there is a subset v.∈V(G),[V.]=i,such that G-V. is an outerplanar graph in particular when G-V.is a forest ,g is called a i-pseudo-tree .in this paper.the following results are proved;(1)the conjecture on the total coloring is true for all 1-pseudo-outerplanar graphs;(2)X1(G)+1 fo any 1-pseudo outerplanar graph g with △(G)≥3,where x4(G)is the total chromatic number of a graph g.
文摘A class of superprocesses which dies out is investigated.Under the condition of norextinction, a new superprocess is constructed,its life time is infinite, and its distribution is determined by the moment function. Several limit theorems about this superprocess and its occupation time process are obtained.
