The average order of a connected vertex set in Km × Pn

Abstract

Let G be a connected graph. Let N(G) and S(G) be the number of connected sets of G and the sum of the orders of these connected sets of G, respectively. Then A(G)=S(G)N(G) is called the average order of a connected set of G. In this paper, we derive a closed-form formula for A(Km × Pn), where Km × Pn is the Cartesian product of the complete graph Km and the path Pn.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…