Labeling the vertex amalgamation of graphs
Let \(G\) be a graph on \(p\) vertices and \(q\) edges. Let the function \(f\) assign different vertex labels from the set \(\{0,1,\dots, q\}\) to the vertices. \(G\) is graceful if the induced edge labels \(| f(u)-f(v)|\) are all distinct. For \(q\geq p\) \(G\) is felicitous if the induced edge labels \((f(u) +f(v))\pmod q\) are all distinct. Let the function \(f\) assign different vertex labels from the set \(\{0,1,\dots, q-1\}\). For \(q\geq p\) \(G\) is harmonious if the induced edge labels \((f(u)+f(v))\pmod q\) are all distinct. The paper presents several methods to preserve the felicitous and harmonious properties after vertex amalgamation of graphs. The authors provide progress on the questions related to the felicitous and graceful properties of amalgamation of \(n\) copies of \(C_m\).
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- On felicitous labelings of H_n and H_n S_m graphs
- Gracefully cultivating trees on a cycle
- scientific article; zbMATH DE number 5360814 (Why is no real title available?)
- Alpha Labeling of Amalgamated Cycles
- Harmonious graphs from \(\alpha \)-trees
- On partitional and other related graphs
- Error-detecting locating dominating sets of Mycielskian of a graph
This page was built for publication: Labeling the vertex amalgamation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458975)