Least common multiple of graphs
T. Reji, Jinitha Varughese · Discrete Mathematics Algorithms and Applications · 2016
A graph [Formula: see text] without isolated vertices is said to be a least common multiple of two graphs [Formula: see text] and [Formula: see text] if [Formula: see text] is a graph of minimum size such that [Formula: see text] is both [Formula: see text] decomposable and [Formula: see text] decomposable. Chartrand et al. proved that every two non-empty graphs [Formula: see text] and [Formula: see text] without isolated vertices have a least common multiple. Size of a least common multiple of [Formula: see text] and [Formula: see text] is denoted by [Formula: see text]. In this paper, least common multiple of some class of graphs are determined.