Labeling the vertex amalgamation of graphs (Q4458975)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2062091
Language Label Description Also known as
default for all languages
No label defined
    English
    Labeling the vertex amalgamation of graphs
    scientific article; zbMATH DE number 2062091

      Statements

      Labeling the vertex amalgamation of graphs (English)
      0 references
      25 March 2004
      0 references
      graph labeling
      0 references
      graceful
      0 references
      harmonious
      0 references
      felicitous
      0 references
      vertex amalgamation
      0 references
      0 references
      0 references
      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\).
      0 references

      Identifiers