2015/11/01 by N. K. Sudev, Sudev, N. K., K. A. Germina +1
Computer Science · Engineering · Mathematics · #05C22 #05C78 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.GM #msc:05C22 #msc:05C78
paper · pdf · doi:10.48550/arxiv.1511.00678
12 pages, Carpathian Mathematical Publications, Vol. 8, Issue 2, 2015, 12 pages
arxiv created 2015/11/01 · openalex publication_date 2015/11/01 · arxiv updated 2015/11/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let \N denote the set of all non-negative integers and \cP(\N) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function f:V(G)→ \cP(\N)-\∅\ such that the induced function f+:E(G) → \cP(\N)-\∅\ is defined by f+ (uv) = f(u)+ f(v), where f(u)+f(v) is the sumset of f(u) and f(v). A graph which admits an IASL is usually called an IASL-graph. An IASL f of a graph G is said to be an integer additive set-indexer (IASI) of G if the associated function f+ is also injective. In this paper, we define the notion of integer additive set-labeling of signed graphs and discuss certain properties of signed graphs which admits certain types of integer additive set-labelings.