\(C_n\)-supermagic labeling of rich calendula graphs
Congressus Numerantium · 18.05.2026 · 237 · 9-35
DOI: 10.61091/cn237-02 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 18.05.2026. Verfasst von D. Froncek.
Abstract (Originalsprache)
Let \(G\) be a graph with vertex set \(V\) and edge set \(E\) such that every edge \(e\in E\) belongs to at least one copy of a given subgraph \(H\) of \(G\). A bijection \(f:V\cup E\to \{1,2,\dots,|V|+|E|\}\) is called an \(H\)-supermagic labeling if the sum of labels of all vertices and edges of every copy of \(H\) is equal to the same number \(\mu\) and the vertices are labeled with the first \(|V|\) integers. A \(p\)-calendula graph \(Cal_{m,p[n]}\) consists of a cycle \(C_m\) with \(p\) copies of \(C_n\) amalgamated to each edge of \(C_m\). We generalize a previous result by Pradipta and Salman on 1-calendula graphs by providing \(C_n\)-supermagic labelings of \(Cal_{m,p[n]}\) for all \(m,n\geq3, p\geq 1\), and \(m\neq n\). The case of \(m=n, \ p>1\) remains open.
Zitieren
APA
Froncek, D. (2026). \(C_n\)-supermagic labeling of rich calendula graphs. Congressus Numerantium, 237, 9-35. https://doi.org/10.61091/cn237-02
Vancouver
Froncek D. \(C_n\)-supermagic labeling of rich calendula graphs. Congressus Numerantium. 2026;237:9-35. doi:10.61091/cn237-02
BibTeX
@article{Froncek2026,
author = {Froncek, D.},
title = {\(C_n\)-supermagic labeling of rich calendula graphs},
journal = {Congressus Numerantium},
year = {2026},
volume = {237},
pages = {9--35},
doi = {10.61091/cn237-02}
}
EUVIMED