20.500.12556/DiRROS-18466 Distance formula for direct-co-direct product in the case of disconnected factors 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. direct-co-direct product distance eccentricity disconnected graphs direktni-ko-direktni produkt razdalja ekscentričnost nepovezan graf true false true Angleški jezik Slovenski jezik Neznano 2024-03-19 12:34:00 2024-03-19 12:34:00 2024-03-20 03:39:23 0000-00-00 00:00:00 2023 0 0 art. P2.13 (21 str.) no. 2 Vol. 6 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2023-01-01 519.17 2590-9770 10.26493/2590-9770.1508.8b5 136454915 adam_1508.pdf adam_1508.pdf 1 CF6FDE6480AD8740560A90E55F768C9A 0173697d7f0669995a344e2d3a6dd60c574eb410cb2de50a9d5a833a16a8d002 d43b17f0-e5e4-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25158 https://adam-journal.eu/index.php/ADAM/article/view/1508 1 955b14c5-e5e4-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25156 Inštitut za matematiko, fiziko in mehaniko 0 0 0