A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) co...A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) consecutive colors modulo t, where dG(v) is the degree of the vertex v in G. The one point union ?of k-copies of cycle Cn is the graph obtained by taking v as a common vertex such that any two distinct cycles? and? are edge disjoint and do not have any vertex in common except v. In this paper, we study the cyclically interval total colorings of , where n≥3 and k≥2.展开更多
在互联网安全领域首屈一指的Check Point软件技术有限公司宣布推出UTM-1 Total Security系列的两款最新型号1070及2070，为客户提供更适合安全及性能要求的方案选择。UTM-1 Total Security设备能使企业享有全面的网络安全保护以及最低...在互联网安全领域首屈一指的Check Point软件技术有限公司宣布推出UTM-1 Total Security系列的两款最新型号1070及2070，为客户提供更适合安全及性能要求的方案选择。UTM-1 Total Security设备能使企业享有全面的网络安全保护以及最低的拥有总成本（TCO）。展开更多
文摘A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors are used, and the edges incident to each vertex v∈V(G) together with v are colored by (dG(v)+1) consecutive colors modulo t, where dG(v) is the degree of the vertex v in G. The one point union ?of k-copies of cycle Cn is the graph obtained by taking v as a common vertex such that any two distinct cycles? and? are edge disjoint and do not have any vertex in common except v. In this paper, we study the cyclically interval total colorings of , where n≥3 and k≥2.
文摘在互联网安全领域首屈一指的Check Point软件技术有限公司宣布推出UTM-1 Total Security系列的两款最新型号1070及2070，为客户提供更适合安全及性能要求的方案选择。UTM-1 Total Security设备能使企业享有全面的网络安全保护以及最低的拥有总成本（TCO）。
