General Position Sets in Two Families of Cartesian Product Graphs-Reference-Cited by-同舟云学术

General Position Sets in Two Families of Cartesian Product Graphs

Published:2023-05-06 Issue:4 Volume:20 Page:
ISSN:1660-5446
Container-title:Mediterranean Journal of Mathematics
language:en
Short-container-title:Mediterr. J. Math.

Author:

Korže Danilo,Vesel Aleksander^ORCID

Abstract

AbstractFor a given graph G, the general position problem asks for the largest set of vertices

$$S \subseteq V(G)$$

S ⊆ V ( G ) , such that no three distinct vertices of S belong to a common shortest path of G. The general position problem for Cartesian products of two cycles as well as for hypercubes is considered. The problem is completely solved for the first family of graphs, while for the hypercubes, some partial results based on reduction to SAT are given.

Funder

Javna Agencija za Raziskovalno Dejavnost RS

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

https://link.springer.com/content/pdf/10.1007/s00009-023-02416-z.pdf

Reference14 articles.

1. Chandran, U.S.V., Parthasarathy, G.J.: The geodesic irredundant sets in graphs. Int. J. Math. Combin. 4, 135–143 (2016)

2. Dudeney, H.E.: Amusements in Mathematics. Nelson, Edinburgh (1917)

3. https://www.msoos.org/cryptominisat5/ (Accessed: 5 May 2023).

4. Klavžar, S., Patkos, B., Rus, G., Yero, I.G.: On general position sets in Cartesian products. Results Math. 76(3), 123 (2021)

5. Klavžar, S., Rus, G.: The general position number of integer lattices. Appl. Math. Comput. 290, 125664 (2021)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Builder-Blocker general position games;COMMUN COMB OPTIM;2024

2. Mutual-visibility problems on graphs of diameter two;European Journal of Combinatorics;2024-08

3. On the general position number of Mycielskian graphs;Discrete Applied Mathematics;2024-08

4. Lower general position in Cartesian products;COMMUN COMB OPTIM;2024

5. Extremal Edge General Position Sets in Some Graphs;Graphs and Combinatorics;2024-03-26