Search the repository

A+ | A- | | SLO | ENG

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
Published in DiRROS: 19.03.2024; Views: 95; Downloads: 54
Full text (450,88 KB)
This document has many files! More...