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.

On certain arithmetic integer additive set-indexers of graphs

    https://doi.org/10.1142/S1793830915500251Cited by:4 (Source: Crossref)

    Let ℕ0 denote the set of all non-negative integers and 𝒫(ℕ0) be its power set. An integer additive set-indexer (IASI) of a graph G is an injective function f : V(G) → 𝒫(ℕ0) such that the induced function f+ : E(G) → 𝒫(ℕ0) defined by f+ (uv) = f(u) + f(v) is also injective. A graph G which admits an IASI is called an integer additive set-indexed graph (IASI-graph). An IASI of a graph G is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of G are in arithmetic progressions. In this paper, we discuss about two special types of arithmetic 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!