TITLE

A Characterisation of weak integer additive Set-Indexers of graphs

AUTHOR(S)
Sudev, N. K.; Germina, K. A.
PUB. DATE
February 2014
SOURCE
Journal of Fuzzy Set Valued Analysis;Feb2014, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
An integer additive set-indexer is defined as an injective function f : V(G) → 2ℕ0 such that the induced function g f : E(G) → 2ℕ0 defined by g f(uv) = f (u)+ f (v) is also injective. An integer additive set-indexer is said to be k-uniform if |g f(e)| = k for all e ∈ E(G). An integer additive set-indexer f is said to be a weak integer additive set-indexer if |g f(uv)| = max(| f (u)|, | f (v)|) for all u, v ∈ V(G). In this paper, we study the characteristics of certain graphs and graph classes which admit weak integer additive set-indexers.
ACCESSION #
94718355

 

Related Articles

  • Weak Integer Additive Set-Indexers of Certain Graph Products. Sudev, N. K.; Germina, K. A. // Journal of Informatics & Mathematical Sciences;2014, Vol. 6 Issue 1, p35 

    Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) of a graph is an injective function ∫ : V(G)→P(N0) such that the induced function ∫+ : E(G) →P(N0) defined by ∫+(uv) = ∫ (u)+ ∫ (v) is also...

  • On Integer Additive Set-Sequential Graphs. Sudev, N. K.; Germina, K. A. // International Journal of Mathematical Combinatorics;Sep2015, Vol. 3, p125 

    A set-labeling of a graph G is an injective function f : V (G) → P(X), where X is a finite set of non-negative integers and a set-indexer of G is a set-labeling such that the induced function f⊕ : E(G) → P(X) - {Ø} defined by f⊕ (uv) = f(u)?⊕(v) for every...

  • INTEGER ADDITIVE SET-INDEXERS OF A GRAPH: SUM SQUARE GRAPHS. GERMINA, K. A.; ANANDAVALLY, T. M. K. // Journal of Combinatorics & System Sciences;Apr-Dec2012, Vol. 37 Issue 2-4, p345 

    B.D. Acharya defined an integer additive set indexer (IASI) of a graph G 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 N0 denotes the set of all nonnegative integers and the notation...

  • On graphs double-critical with respect to the colouring number. Kriesell, Matthias; Pedersen, Anders Sune // Discrete Mathematics & Theoretical Computer Science (DMTCS);2015, Vol. 17 Issue 2, p49 

    The colouring number col(G) of a graph G is the smallest integer κ for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified order no vertex of degree more than κ -- 1 in the remaining graph is removed at any step. An edge e of a graph G...

  • LINEAR SYSTEMS FOR CONSTRAINED MATCHING PROBLEMS. Cook, W.; Pulleyblank, W.R. // Mathematics of Operations Research;Feb87, Vol. 12 Issue 1, p97 

    Each polyhedron of full dimension has a unique (up to positive scalar multiples of the inequalities) minimal defining system and a unique minimal totally dual integral defining system with integer left hand sides. These two minimal systems are characterised for the convex hull of the simple...

  • ON SET-INDEXERS OF GRAPHS. Thomas, Ullas; Mathew, Sunil C. // Palestine Journal of Mathematics;2014, Vol. 3 Issue 2, p273 

    This paper derives the set-indexing numbers of certain graphs subsequently identifying some set-semigraceful graphs

  • Universal H-Colourable Graphs. Broere, Izak; Heidema, Johannes // Graphs & Combinatorics;Sep2013, Vol. 29 Issue 5, p1193 

    Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: for given m and n with m < n, m is adjacent to n if n has a 1 in the mth position of its binary expansion. It is well known that R is a universal graph in the set...

  • Unitary Addition Cayley Signed Graphs. Sinha, Deepa; Dhama, Ayushi; Acharya, B. D. // European Journal of Pure & Applied Mathematics;2013, Vol. 6 Issue 2, p189 

    A signed graph (or sigraph in short) is an ordered pair S = (Su,σ), where Su is a graph G = (V, E) and σ : E →{+,-} is a function from the edge set E of Su into the set {+,-}. For a positive integer n, the unitary addition Cayley graph Gn is the graph whose vertex set is Zn, the...

  • Bipartite Divisor Graphs for Integer Subsets. Iranmanesh, Mohammad A.; Praeger, Cheryl E. // Graphs & Combinatorics;Jan2010, Vol. 26 Issue 1, p95 

    Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph G( X) and the prime vertex graph ?( X), for a set X of positive integers, we define the bipartite divisor graph B( X), and show that many of these connections flow naturally from properties of...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics