ترجمه مقاله نقش ضروری ارتباطات 6G با چشم انداز صنعت 4.0
- مبلغ: ۸۶,۰۰۰ تومان
ترجمه مقاله پایداری توسعه شهری، تعدیل ساختار صنعتی و کارایی کاربری زمین
- مبلغ: ۹۱,۰۰۰ تومان
Abstract
This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs. Also a notion of total proper connection is introduced and a question is asked about a possible relationship between the total proper connection number and the vertex and edge proper connection numbers.
4. Total proper connection
A natural definition of a total proper connection number is the following. Let tpc(G) be the minimum number of colors needed to color the vertices and edges of G so that between every pair of vertices u, v, there is a path P = Pu,v such that the vertices of P induce a properly (vertex-)colored path and the edges of P also induce a properly (edge-) colored path. Furthermore, we define tpck (G) to be the minimum number of colors needed to produce k internally disjoint such paths between every pair of vertices. One might think that tpck (G) might simply be the maximum of pck (G) and vpck (G) but this is not obvious even when k = 1 since the edge path (for pc) and the vertex path (for vpc) must be the same path. Indeed, in Question 1, we ask whether this equality holds in general. Our results concerning the function tpc support a positive answer to this question.