| Title: | Distance formula for direct-co-direct product in the case of disconnected factors |
|---|
| Authors: | ID Kelenc, Aleksander (Author)
ID Peterin, Iztok (Author) |
|---|
| Files: |  PDF - Presentation file, download (450,88 KB)
MD5: CF6FDE6480AD8740560A90E55F768C9A
 URL - Source URL, visit https://adam-journal.eu/index.php/ADAM/article/view/1508
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | direct-co-direct product, distance, eccentricity, disconnected graphs |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.01.2023 |
|---|
| Year of publishing: | 2023 |
|---|
| Number of pages: | art. P2.13 (21 str.) |
|---|
| Numbering: | Vol. 6, no. 2 |
|---|
| PID: | 20.500.12556/DiRROS-18466  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 2590-9770 |
|---|
| DOI: | 10.26493/2590-9770.1508.8b5 |
|---|
| COBISS.SI-ID: | 136454915 |
|---|
| Note: |
|
|---|
| Publication date in DiRROS: | 19.03.2024 |
|---|
| Views: | 543 |
|---|
| Downloads: | 253 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
