| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

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 adam_1508.pdf (449,36 KB)
MD5: DC46051894A79FA1C2B64354F67CA29D
 
URL https://adam-journal.eu/index.php/ADAM/article/view/1508
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Direktni-ko-direktni produkt ▫$G\circledast H$▫ grafov ▫$G$▫ in ▫$H$▫ je graf na množizi vozlišč ▫$V(G)\times V(H)$▫. Vozlišči ▫$(g,h)$▫ in ▫$(g',h')$▫ sta sosednji, če je ▫$gg'\in E(G)$▫ in ▫$hh'\in E(H)$▫ ali ▫$gg'\notin E(G)$▫ in ▫$hh'\notin E(H)$▫. Naj bo največ eden izmed faktorjev ▫$G$▫ in ▫$H$▫ povezan. Pokažemo da je razdalja med dvema vozliščema v ▫$G\circledast H$▫ omejena s tri, razen v majhnem številu izjem. Vse izjeme so natančno popisane, kar prinese razdaljno formulo za ▫$G\circledast H$▫.
Keywords:direktni-ko-direktni produkt, razdalja, ekscentričnost, nepovezan graf, direct-co-direct product, distance, eccentricity, disconnected graphs
Publication status:Published
Publication version:Version of Record
Submitted for review:21.11.2021
Article acceptance date:25.09.2022
Publication date:04.01.2023
Publisher:Fakulteta za matematiko, naravoslovje in informacijske tehnologije
Year of publishing:2023
Number of pages:art. P2.13 (21 str.)
Numbering:ǂVol. ǂ6, ǂno. ǂ2
PID:20.500.12556/DKUM-87584 New window
UDC:519.17
ISSN on article:2590-9770
COBISS.SI-ID:136454915 New window
DOI:10.26493/2590-9770.1508.8b5 New window
Publication date in DKUM:21.05.2024
Views:239
Downloads:24
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The art of discrete and applied mathematics
Publisher:Fakulteta za matematiko, naravoslovje in informacijske tehnologije
ISSN:2590-9770
COBISS.SI-ID:290758912 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2452
Name:Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

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
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:direktni-ko-direktni produkt, razdalja, ekscentričnost, nepovezan graf


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica