A Study on Set-Valuations of Signed Graphs

Abstract

Let X be a non-empty ground set and P(X) be its power set. A set-labeling (or a set-valuation) of a graph G is an injective set-valued function f:V(G) P(X) such that the induced function f:E(G) P(X) is defined by f(uv) = f(u) f(v), where f(u) f(v) is the symmetric difference of the sets f(u) and f(v). A graph which admits a set-labeling is known to be a set-labeled graph. A set-labeling f of a graph G is said to be a set-indexer of G if the associated function f is also injective. In this paper, we define the notion of set-valuations of signed graphs and discuss certain properties of signed graphs which admits certain types of set-valuations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…