On monophonic position sets of Cartesian and lexicographic products of graphs

The general position problem in graph theory asks for the number of vertices in a largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$. The analogous monophonic position problem is obtained from the general position problem by replacing...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	V, Ullas Chandran S, Klavžar, Sandi, K, Neethu P, Tuite, James
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!