Anti-Ramsey numbers for cycles in the generalized Petersen graphs

Huiqing Liu, Mei Lu and Shunzhe Zhang

Applied Mathematics and Computation, 2022, vol. 430, issue C

Abstract: For H⊆G, the anti-Ramsey number ar(G,H) is the maximum number of colors in an edge-coloring of G such that each subgraph isomorphic to H has at least two edges in the same color. The study of anti-Ramsey number ar(Kn,H) was introduced by Erdős et al. in 1973, and plentiful results were researched for some special graph H. Later, the problem was extended to ar(G,H) when replacing Kn by other graph G such as hypergraph, complete split graph, regular bipartite graph, triangulation and so on. In this paper, we consider a generalized Petersen graph Pn,k as the host graph and determine the exact anti-Ramsey numbers for cycles C5 and C6 in Pn,k, respectively.

Keywords: Anti-Ramsey number; Generalized Petersen graph; Cycle (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322003514
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:430:y:2022:i:c:s0096300322003514

DOI: 10.1016/j.amc.2022.127277

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 ().