Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Repository of the University of Ljubljana
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Advanced
New in RUL
About RUL
In numbers
Help
Sign in
Details
General position problems in strong and lexicographic products of graphs
ID
Dokyeesun, Pakanun
(
Author
),
ID
Klavžar, Sandi
(
Author
),
ID
Kuziak, Dorota
(
Author
),
ID
Tian, Jing
(
Author
)
PDF - Presentation file,
Download
(342,67 KB)
MD5: 2ADC0875F58459D1B8882BE8E60F2618
URL - Source URL, Visit
https://link.springer.com/article/10.1007/s40314-025-03547-7
Image galllery
Abstract
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 is established 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.
Language:
English
Keywords:
outer general position
,
dual general position
,
total general position
,
strong product
,
lexicographic product
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FMF - Faculty of Mathematics and Physics
Publication status:
Published
Publication version:
Version of Record
Publication date:
01.04.2026
Year:
2026
Number of pages:
13 str.
Numbering:
Vol. 45, iss. 3, art. no. 97
PID:
20.500.12556/RUL-176920
UDC:
519.17
ISSN on article:
2238-3603
DOI:
10.1007/s40314-025-03547-7
COBISS.SI-ID:
261377795
Publication date in RUL:
15.12.2025
Views:
45
Downloads:
7
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Record is a part of a journal
Title:
Computational & Applied Mathematics
Shortened title:
Comput. Appl. Math.
Publisher:
Springer, Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:
2238-3603
COBISS.SI-ID:
73925379
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Secondary language
Language:
Slovenian
Keywords:
zunanja splošna lega
,
dualna splošna lega
,
celotna splošna lega
,
krepki produkt grafov
,
leksikografski produkt grafov
Projects
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0285
Name:
Metrični problemi v grafih in hipergrafih
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0355
Name:
Prirejanja, transverzale in hipergrafi
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0431
Name:
Dominacija v grafih: kubični grafi, produkti in igre
Funder:
Spanish Ministry of Science and Innovation
Project number:
PID2023-146643NB-I00
Funder:
“Ministerio de Educación, Cultura y Deporte”
Funding programme:
“José Castillejo” program for young researchers
Project number:
CAS22/00081
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back