Cycle multiplicity of some total graphs

摘要

Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. Simoes Pereira gave the formula of cycle multiplicity for line and total graph of forests. Recently, Akbar Ali determined cycle multiplicity of total graph for Cn and K1, n. In this paper, we determine the cycle multiplicity of some Cartesian product graphs, the total graphs of complete graph, complete bipartite graph and unicycle graph, which generalize the results of Akbar Ali and Panayappan (2010) in [1].