The Liner multiplexers for generalizing the distance of vehicle data from the complete statement with Some private data

Abstract It may be possible to find the Wiener polynomial with respect to a generalized distance of a compound graph constructed from two graphs having some kind of regularity. In this paper, we obtain the Wiener polynomials for a generalized distance of compound graphs constructed from a complete graph with some other special graph, such as a complete bipartite graph, a star, and a wheel, using binary operations defined by Gutman [4]. The Wiener index with respect to such generalized distance for each such compound graph is also obtained. , , , , [4] Gutman. .