Cycle multiplicity of some total graphs

被引：0

作者：

Li, Yinkui ^{[1
,2
]}

机构：

[1] Tianjin Univ, Ctr Appl Math, Tianjin 300071, Peoples R China

[2] Qinghai Nationalities Univ, Dept Math, Xining 810000, Qinghai, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2017年 / 292卷

关键词：

Cycle multiplicity; Cartesian product; Line graph; Total graph; EDGE-DISJOINT CYCLES;

D O I：

10.1016/j.amc.2016.06.042

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 C-n and K-1,K-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]. (C) 2016 Elsevier Inc. All rights reserved.

引用

页码：107 / 113

页数：7