Vertex Ranking number of Graphs 图的点排序数.ppt

Vertex Ranking number of Graphs圖的點排序數 國立東華大學應用數學系 林 興 慶 Lin-Shing-Ching 指導教授:郭大衛 A vertex ranking of a graph G is a mapping f from V(G) to the set of all natural number such that for any path between two distinct vertices u and v with f(u)=f(v) there is a vertex w in the path f(w)f(u).In this definition,we call the value f(v) the rank of the vertex v. The vertex ranking problem is to determine the vertex ranking number r(G) of a given graph G. Lemma If H is a subgraph of G,then r(H) ≦r(G) . The union of two disjoint graph G and H is the G∪H vertex set V(G∪H)=V(G)∪V(H)  edge set E(G∪H)=E(G)∪E(H) Lemma For any graph G, r(G)={minr*(Gs):S is a minimal cut set of G} Lemma For any graph G,r(G)=min{r(G˙S)+1:S is an independent set of G} Gr is a graph withV(Gr)=V(G)E(Gr)={uv｜u,v ∈V(G) and dG(u,v)≦r} Theorem For all n,k with n≧3 and n≧k-1 Theorem For allTheorem For all Cartesian product of two graph G and H is G×H V(G×H)={(u,v)｜u∈V(G) v ∈V(H)} E(G×H)={(u,x)(v,y)｜(u=v),xy∈E(H) or(uv∈E(G),x=y)} Theorem For a caterpillar T. Let Pn be the  subgraph of T obtained from T by  deleting all leaves of T,and {v ∈V(Pn):dG≧3 }={vj1,vj2,…,vjk}, where j1≦j2≦… ≦jk. If we let j0=0,jk+1=n+1. then r(T)=r(Pl)+1 where Composition of two graph,written G[H]vertex set V(G) ×V(H)edge set (u1,v1)is adjacent to(u2,v2)if eithher u1 is adjacent to u2 in G Theorem For any two graphs G and H. vertex set edge set Corona of two graphs,written GΛH. vertex set V(GΛH)=V(G) ∪{uij|1≦i≦n,1≦j≦m}  edge set 感謝各位的參與 * * 1 3 5 7 9 2 8 4 6 1 1 1 1 1 2 2 3 4 r(G)=4 Lemma 1 1 1 1 1 2 2 3 4 1 1 1 2 3 r(G1)=4 r(G2)=3 r(G1∪G2)=4 1 1 3 1 1 2 2 3 4 1 1 1 1 1 1 1 1 1 2 2 2 3 3 4 4 5 6 P9 P2×9 1 P12 2 2 3 4 G˙S 1 1 1 1 1 3 2 P12 1 1 1 2 2 2 2 2 3 3 4 5 G˙S The join of two graph G and H is the G+H with vertex set V(G+H)=V(G)∪V(H) edge set E(G+H)=E(G) ∪E(H)