Distance formula for direct-co-direct product in the case of disconnected factorsKelenc, Aleksander (Avtor) Peterin, Iztok (Avtor) direct-co-direct productdistanceeccentricitydisconnected graphsDirect-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.20232024-03-19 12:34:00Neznano18466UDK: 519.17ISSN pri članku: 2590-9770DOI: 10.26493/2590-9770.1508.8b5COBISS_ID: 136454915sl