Year: 2026
Type: article
Abstract: A set X of vertices of a connected graph G having no three vertices that lie in a same geodesic is a general position set of G. A general position set in G is maximal if it is not properly contained in any other general position set. We are interested in this work into counting the number of maximal general position sets that a given connected graph has. In particular, we consider such counting for classical graph classes including grids, trees and hypercubes.
Author: Ismael Gonzalez Yero
Institution: Universidad de Cádiz
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Awards: G745419941, G8537714269
OpenAlex ID: W7221583886
FWCI:
Cites:
Cited by:
Related to: