Operations on totally weighted graphs

Abstract

The investigation and study of different operations on graphs leads many interesting results in various branches of science and technology. The operations of union, join, corona, Cartesian product and strong product in totally weighted graphs are introduced in this article. The types of edges in the resultant graphs are studied and strong connectivity indices of totally weighted graphs through these graph operations are discussed here. Weighted graph operations are relevant, as many complicated networks can be obtained through the operations of basic types of networks.