A study on integer additive set-graceful graphs

zbMATH Open1449.05229arXiv1403.3984MaRDI QIDQ786201FDOQ786201

K. A. Germina, N. K. Sudev

Publication date: 12 August 2020

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Abstract: A set-labeling of a graph $G$ is an injective function $f:V(G)omathcalP(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{oplus}:E(G)ightarrowmathcalP(X)-emptyset$ defined by $f^{oplus}(uv)=f(u)oplusf(v)$ for every $uvinE(G)$ is also injective. An integer additive set-labeling is an injective function $f:V(G)ightarrowmathcalP(mathbb{N}_0)$, $mathbb{N}_0$ is the set of all non-negative integers and an integer additive set-indexer is an integer additive set-labeling such that the induced function $f^{+}:E(G)ightarrowmathcalP(mathbb{N}_0)$ defined by $f^{+}(uv)=f(u)+f(v)$ is also injective. In this paper, we extend the concepts of set-graceful labeling to integer additive set-labelings of graphs and provide some results on them.

Full work available at URL: https://arxiv.org/abs/1403.3984

zbMATH Keywords

integer additive set-graceful graphsinteger additive set-indexed graphsset-graceful graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (3)

• Title not available (Why is that?)
• On ideal sumset labelled graphs
• Additively graceful graphs

This page was built for publication: A study on integer additive set-graceful graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786201)