General position problems in strong and lexicographic products of graphs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dokyeesun, Pakanun, Klavžar, Sandi, Kuziak, Dorota, Tian, Jing
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909960847228928
author Dokyeesun, Pakanun
Klavžar, Sandi
Kuziak, Dorota
Tian, Jing
author_facet Dokyeesun, Pakanun
Klavžar, Sandi
Kuziak, Dorota
Tian, Jing
contents Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general position number of strong products and several exact values are obtained. For the lexicographic product, the outer general position number is determined in all the cases, and the dual general position number in many cases. The total general position number is determined for both products. Along the way some results on outer general position sets are also derived.
format Preprint
id arxiv_https___arxiv_org_abs_2408_15951
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle General position problems in strong and lexicographic products of graphs
Dokyeesun, Pakanun
Klavžar, Sandi
Kuziak, Dorota
Tian, Jing
Combinatorics
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general position number of strong products and several exact values are obtained. For the lexicographic product, the outer general position number is determined in all the cases, and the dual general position number in many cases. The total general position number is determined for both products. Along the way some results on outer general position sets are also derived.
title General position problems in strong and lexicographic products of graphs
topic Combinatorics
url https://arxiv.org/abs/2408.15951