Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Study on the Modular Sumset Labeling of Graphs

Published 3 Aug 2015 in math.GM | (1508.00319v2)

Abstract: For a positive integer $n$, let $\mZ$ be the set of all non-negative integers modulo $n$ and $\sP(\mZ)$ be its power set. A modular sumset valuation or a modular sumset labeling of a given graph $G$ is an injective function $f:V(G) \to \sP(\mZ)$ such that the induced function $f+:E(G) \to \sP(\mZ)$ defined by $f+ (uv) = f(u)+ f(v)$. A sumset indexer of a graph $G$ is an injective sumset valued function $f:V(G) \to \sP(\mZ)$ such that the induced function $f+:E(G) \to \sP(\mZ)$ is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.