General Position and Edge General Position Problems for Unitary Cayley Graphs: A Direct Product Approach

Zahra Hamed-Labbafian and Mostafa Tavakoli

Journal of Mathematics, 2026, vol. 2026, 1-9

Abstract: Let G be a connected graph. A subset S⊆VG is called a general position set of a graph G if no shortest path in G contains more than two vertices from S. Likewise, a subset X⊆EG is an edge general position set if no shortest path contains more than two edges from X. The maximum cardinalities of such sets are known as the general position number and the edge general position number, respectively. This paper focuses on determining these values for the unitary Cayley graph GZn, employing structural methods based on the direct product of graphs. For n=p1α1p2α2 with p1

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2026/3684640.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2026/3684640.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3684640

DOI: 10.1155/jom/3684640

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().