Toll number of the strong product of graphs

Abstract

A tolled walk T between two non-adjacent vertices u and v in a graph G is a walk, in which u is adjacent only to the second vertex of T and v is adjacent only to the second-to-last vertex ofis the union of toll intervals between all pairs of vertices from S. The size of a smallest set S whose toll closure is the whole vertex set is called a toll number of a graph G, tn(G). This paper investigates the toll number of the strong product of graphs. First, a description of toll intervals between two vertices in the strong product graphs is given. Using this result we characterize graphs with tn(G ⊠ H) = 2 and graphs with tn(G ⊠ H) = 3, which are the only two possibilities. As an addition, for the t-hull number of G ⊠ H we show that th(G ⊠ H) = 2 for any non complete graphs G and H. As extreme vertices play an important role in different convexity types, we show that no vertex of the strong product graph of two non complete graphs is an extreme vertex with respect to the toll convexity.

Minimum strong radius of the strong product of paths

“…From the definition, we can see that in the case of the same factor graph, the cartesian product graph is a subgraph of the strong product graph. At present, the research on product graphs is very rich [11][12][13][14][15][16][17].…”