| Naslov: | General position problems in strong and lexicographic products of graphs |
|---|
| Avtorji: | ID Dokyeesun, Pakanun (Avtor) ID Klavžar, Sandi (Avtor) ID Kuziak, Dorota (Avtor) ID Tian, Jing (Avtor) |
| Datoteke: | PDF - Predstavitvena datoteka, prenos (351,34 KB) MD5: D01DF2D9877917EFA8B28F81C90B8AAF
URL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s40314-025-03547-7
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | 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. |
|---|
| Ključne besede: | outer general position, dual general position, total general position, strong product, lexicographic product |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.04.2026 |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | 13 str. |
|---|
| Številčenje: | Vol. 45, iss. 3, article no. 97 |
|---|
| PID: | 20.500.12556/DiRROS-24709  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 2238-3603 |
|---|
| DOI: | 10.1007/s40314-025-03547-7  |
|---|
| COBISS.SI-ID: | 261377795  |
|---|
| Datum objave v DiRROS: | 15.12.2025 |
|---|
| Število ogledov: | 6 |
|---|
| Število prenosov: | 4 |
|---|
| Metapodatki: |  |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |