| Naslov: | Distance formula for direct-co-direct product in the case of disconnected factors |
|---|
| Avtorji: | ID Kelenc, Aleksander (Avtor)
ID Peterin, Iztok (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (450,88 KB)
MD5: CF6FDE6480AD8740560A90E55F768C9A
 URL - Izvorni URL, za dostop obiščite https://adam-journal.eu/index.php/ADAM/article/view/1508
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | Direct-co-direct product $G\circledast H$ of graphs $G$ and $H$ is a graph on the vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ are adjacent if $gg'\in E(G)$ and $hh'\in E(H)$ or $gg'\notin E(G)$ and $hh'\notin E(H)$. We show that if at most one factor of $G\circledast H$ is connected, then the distance between two vertices of $G\circledast H$ is bounded by three unless some small number of exceptions. All the exceptions are completely described which yields the distance formula. |
|---|
| Ključne besede: | direct-co-direct product, distance, eccentricity, disconnected graphs |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.01.2023 |
|---|
| Leto izida: | 2023 |
|---|
| Št. strani: | art. P2.13 (21 str.) |
|---|
| Številčenje: | Vol. 6, no. 2 |
|---|
| PID: | 20.500.12556/DiRROS-18466  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 2590-9770 |
|---|
| DOI: | 10.26493/2590-9770.1508.8b5 |
|---|
| COBISS.SI-ID: | 136454915 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 19.03.2024 |
|---|
| Število ogledov: | 80 |
|---|
| Število prenosov: | 44 |
|---|
| Metapodatki: |     |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
