📖
On Integer Additive Set-Valuations of Finite Jaco Graphs
Sudev Naduvath, K P Chithra, K A Germina

On Integer Additive Set-Valuations of Finite Jaco Graphs

Science & Mathematics Published 2016 Verification Pending

Overview & Synopsis

Let X denote a set of non-negative integers and P (X ) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function f : V (G) → P (X ) −{;} where induced function f + : E(G) → P (X ) − {;} is defined by f + (uv) = f (u) + f (v), where f (u) + f (v) is the sumset of f (u) and f (v). Let f (x) = mx + c; m ∈ N , c ∈ N 0 . A finite linear Jaco graph, denoted by J n ( f (x)), is a directed graph with vertex set { v i : i ∈ N } such that (v i , v j ) is an arc of J n ( f (x)) if and only if f (i) + i − d − (v j ) ≥ j. In this paper, we discuss the admissibility of different types of integer additive set-labeling by finite linear Jaco graphs.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title On Integer Additive Set-Valuations of Finite Jaco Graphs
Author / Organization Sudev Naduvath, K P Chithra, K A Germina
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2016
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-146972
Original Source Link Visit Source Page on hal.science »