Topological Integer Additive Set-Graceful Graphs

نویسندگان

  • K. P. Chithra
  • K. A. Germina
  • B. D. Acharya
  • K. L. Princy
  • S. B. Rao
  • J. A. Bondy
  • U. S. R. Murty
چکیده

Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective 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 sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IASL) if f(V (G)) [ f;g is a topology of the ground set X. An IASL is said to be an integer additive set-graceful labeling (IASGL) if for the induced edgefunction f+, f+(E(G)) = P(X)??f;; f0gg. In this paper, we study certain types of IASL of a given graph G, which is a topological integer additive set-labeling as well as an integer additive set-graceful labeling of G.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

On Topological Numbers of Graphs

This paper introduces the notion of discrete t-set graceful graphs and obtains some of their properties. It also examines the interrelations among different types of set-indexers, namely, set-graceful, set-semigraceful, topologically set-graceful (t-set graceful), strongly t-set graceful and discrete t-set graceful and establishes how all these notions are interdependent or not. AMS Mathematics...

متن کامل

Graceful labelings of the generalized Petersen graphs

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...

متن کامل

Weak Integer Additive Set-Indexers of Certain Graph Products

An integer additive set-indexer is defined as an injective function f : V (G) → 2N0 such that the induced function gf : E(G) → 2N0 defined by gf (uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). If gf (uv) = k ∀ uv ∈ E(G), then f is said to be a k-uniform integer additive set-indexers. An integer additive set-indexer f is said to be a weak integer additive ...

متن کامل

Topological additive numbering of directed acyclic graphs

We propose to study a problem that arises naturally from both Topological Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as Lucky Labeling). Let D be a digraph and f a labeling of its vertices with positive integers; denote by S(v) the sum of labels over all neighbors of each vertex v. The labeling f is called topological additive numbering if S(u) < S(v) for each arc (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015