Cycle multiplicity of some total graphs

Yinkui Li

Applied Mathematics and Computation, 2017, vol. 292, issue C, 107-113

Abstract: 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].

Keywords: Cycle multiplicity; Cartesian product; Line graph; Total graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316304222
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:292:y:2017:i:c:p:107-113

DOI: 10.1016/j.amc.2016.06.042

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().