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.

Some new results on strong integer additive set-indexers of graphs

    https://doi.org/10.1142/S1793830914500657Cited by:7 (Source: Crossref)

    Let ℕ0 be the set of all non-negative integers. An integer additive set-indexer (IASI) of a graph G is an injective function f : V(G) → 20 such that the induced function gf : E(G) → 20 defined by f+(uv) = f(u) + f(v) is also injective. An IASI is said to be k-uniform if |f+(e)| = k for all e ∈ E(G). In this paper, we introduce the notions of strong IASIs and initiate a study of the graphs which admit strong IASIs.

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

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