Naslov: | Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products |
---|
Avtorji: | ID Tian, Jing (Avtor) ID Klavžar, Sandi (Avtor) |
Datoteke: | PDF - Predstavitvena datoteka, prenos (184,44 KB) MD5: EDFB9CDC75AA5383D4B976DE59F57264
URL - Izvorni URL, za dostop obiščite https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2496
|
---|
Jezik: | Angleški jezik |
---|
Tipologija: | 1.01 - Izvirni znanstveni članek |
---|
Organizacija: | IMFM - Inštitut za matematiko, fiziko in mehaniko
|
---|
Povzetek: | If $G$ is a graph and $X\subseteq V(G)$, then $X$ is a total mutual-visibility set if every pair of vertices $x$ and $y$ of $G$ admits a shortest $x,y$-path $P$ with $V(P) \cap X \subseteq \{x,y\}$. The cardinality of a largest total mutual-visibility set of $G$ is the total mutual-visibility number $\mu_{\rm t}(G)$ of $G$. Graphs with $\mu_{\rm t}(G) = 0$ are characterized as the graphs in which no vertex is the central vertex of a convex $P_3$. The total mutual-visibility number of Cartesian products is bounded and several exact results proved. For instance, $\mu_{\rm t}(K_n\,\square\, K_m) = \max\{n,m\}$ and $\mu_{\rm t}(T\,\square\, H) = \mu_{\rm t}(T)\mu_{\rm t}(H)$, where $T$ is a tree and $H$ an arbitrary graph. It is also demonstrated that $\mu_{\rm t}(G\,\square\, H)$ can be arbitrary larger than $\mu_{\rm t}(G)\mu_{\rm t}(H)$. |
---|
Ključne besede: | mutual-visibility set, total mutual-visibility set, bypass vertex, Cartesian product of graphs, trees |
---|
Status publikacije: | Objavljeno |
---|
Verzija publikacije: | Objavljena publikacija |
---|
Datum objave: | 01.01.2024 |
---|
Leto izida: | 2024 |
---|
Št. strani: | str. 1277–1291 |
---|
Številčenje: | Vol. 44, no. 4 |
---|
PID: | 20.500.12556/DiRROS-20228 ![Povezava se odpre v novem oknu Novo okno](teme/dirros/img/NovoOkno.png) |
---|
UDK: | 519.17 |
---|
ISSN pri članku: | 1234-3099 |
---|
DOI: | 10.7151/dmgt.2496 ![Povezava se odpre v novem oknu Novo okno](teme/dirros/img/NovoOkno.png) |
---|
COBISS.SI-ID: | 204706307 ![Povezava se odpre v novem oknu Novo okno](teme/dirros/img/NovoOkno.png) |
---|
Opomba: | Spletna objava: 1. 5. 2023;
|
---|
Datum objave v DiRROS: | 26.08.2024 |
---|
Število ogledov: | 12 |
---|
Število prenosov: | 8 |
---|
Metapodatki: | ![Izvoz v DC-RDF DC-RDF](teme/dirros/img/icon_dc_rdf.gif) |
---|
:
|
Kopiraj citat |
---|
| | | Objavi na: | ![Bookmark and Share](teme/dirros/img/addtoany.png) |
---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |