Oriented diameter of the complete tripartite graph
Sign Up to like & getrecommendations! Published in 2025 at "Filomat"
DOI: 10.2298/fil2502675l
Abstract: Given a connected and bridgeless graph G, let D(G) be the set of all strong orientations of G, and define the oriented diameter of G to be ? (G) = min{diam(D) | D ? D(G)}.… read more here.
Keywords: diameter complete; complete tripartite; oriented diameter; tripartite graph ... See more keywords