Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A study on the modular sumset labeling of graphs

    https://doi.org/10.1142/S1793830917500392Cited by:2 (Source: Crossref)

    For a positive integer n, let n be the set of all non-negative integers modulo n and 𝒫(n) 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)𝒫(n) such that the induced function f+:E(G)𝒫(n) defined by f+(uv)=f(u)+f(v). A modular sumset indexer of a graph G is an injective modular sumset valued function f:V(G)𝒫(n) such that the induced function f+:E(G)𝒫(n) is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.

    AMSC: 05C78, 11B13
    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!