1 citations · 1 across the 7 of their papers we have counts for
11 papers · 1 filter
The general position number of digraphs
Ullas Chandran S. V., Gabriele Di Stefano, Grahame Erskine +3
The general position number for graphs ask for largest vertex subsets such that no three vertices are contained on a common shortest path. We examine this problem in the settin…
There are no excess one digraphs
Slobodan Filipovski, Arnau Messegué, Josep M. Miret +1
A digraph is \emph{-geodetic} if for any pair there is at most one -walk of length not exceeding . The order of a -geodetic digraph with minimum ou…
Solution to some conjectures on mobile position problems
Ethan Shallcross, James Tuite, Aoise Evans +2
The general position problem for graphs asks for the largest number of vertices in a subset of a graph such that for any and any shortest -p…
Moving through Cartesian products, coronas and joins in general position
Sandi Klavžar, Aditi Krishnakumar, Dorota Kuziak +3
The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was de…
Monophonic position sets of Cartesian and lexicographic products of graphs
Ullas Chandran S. V., Sandi Klavžar, Neethu P. K. +1
The general position problem in graph theory asks for the number of vertices in a largest set of vertices of a graph such that no shortest path of contains more than tw…
Lower General Position in Cartesian Products
Eartha Kruft Welton, Sharif Khudairi, James Tuite
A subset of vertices of a graph is in \emph{general position} if no shortest path in contains three vertices of . The \emph{general position problem} consists of fin…