On the total mutual-visibility number

Let G be a graph with vertex-set V(G) and A _x۰۰۱۶_۶ V(G). Then A is a total k-clique mutual-visibility set if for each two distinct k-cliques X and Y of G, there exists a shortest X, Y-path P such that V(P) _x۰۰۱۶_۶ V(X) _x۰۰۱۶_۵ V(Y). The order of a largest total k-clique mutual-visibility set of G is the total k-clique mutual-visibility number _x۰۰۰۳_ (G) which is an extension of the total mutual-visibility number of G. In this paper, we determine the total k-clique mutual-visibility number for several families of graphs.

کلیدواژه ها:

Total mutual-visibility number ، Total k-clique mutual-visibility number ، Helm graph