The general position number of the Cartesian product of two trees

Abstract

The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path. In this paper it is proved that the general position number is additive on the Cartesian product of two trees.

References in corpus (1)

• The general position number of the Cartesian product of two trees

Cited by in corpus (4)

• The general position number of the Cartesian product of two trees
• Mutual-visibility and general position in double graphs and in Mycielskians
• General position problems in strong and lexicographic products of graphs
• The general position number under vertex and edge removal