2016/01/01 by Sudev Naduvath, Naduvath Sudev, Sudev, Naduvath
Computer Science · Decision Sciences · Mathematics · #05C78 #Advanced Algebra and Logic #Advanced Graph Theory Research #FOS: Mathematics #Fuzzy and Soft Set Theory #General Mathematics (math.GM) #math.GM #msc:05C78
paper · pdf · doi:10.48550/arxiv.1601.02662
8 pages, 3 figures, communicated
arxiv created 2016/01/01 · openalex publication_date 2016/01/01 · arxiv updated 2016/01/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Let X be a non-empty set and \sP(X) be its power set. A set-valuation or a set-labeling of a given graph G is an injective function f:V(G) → \sP(X) such that the induced function f∗:E(G) → \sP(X) defined by f∗ (uv) = f(u)∗ f(v), where ∗ is a binary operation on sets. A set-indexer of a graph G is an injective set-valued function f:V(G) → \sP(X) such that the induced function f∗:E(G) → \sP(X) is also injective. In this paper, two types of set-labelings, called conjunctive set-labeling and disjunctive set-labeling, of graphs are introduced and some properties and characteristics of these types of set-labelings of graphs are studied.