On the general position number of Mycielskian graphs

Thomas, Elias; Chandran, Ullas; Tuite, James and Di Stefano, Gabriele (2024). On the general position number of Mycielskian graphs. Discrete Applied Mathematics, 353 pp. 29–43.

DOI: https://doi.org/10.1016/j.dam.2024.03.015

Abstract

The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$. The \emph{general position number} of $G$ is the number of vertices in a largest general position set. In this paper we investigate the general position numbers of the Mycielskian of graphs. We give tight upper and lower bounds on the general position number of the Mycielskian of a graph $G$ and investigate the structure of the graphs meeting these bounds. We determine this number exactly for common classes of graphs, including cubic graphs and a wide range of trees.

Viewing alternatives

Look up in Google Scholar

Download history

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

CORE (COnnecting REpositories)