Abstract Motivated by the papers of Peay [1], Acharya [2], and SedlaÄek [3], we introduce out set-magic indexer of digraphs: Let X be a nonempty set, 2 X denote the power-set of X. As in [2], given a digraph D with p vertices and q arcs, no-self loops, and parallel arcs, is labeled by assigning to each vertex an element from the set 2 X . An arc (x, y) from a vertex x to y is labeled with f âŠ•(x, y) = f (x) âŠ• f (y), where f (x) and f (y) are the values assigned to x and y, and â€œ âŠ• â€ is the symmetric difference of the sets. Such an assignment is called a set-indexer if f and f âŠ• are injective. A set-indexer f of a digraph D is called an out set-magic indexer if, U xâˆ¼e f âŠ•(e) = X, for all xâˆˆ V(D). A digraph admitting an out set-magic indexer is called an out set-magic digraph. In this paper we give some necessary conditions for a digraph to admit an out set-magic indexer, provide the sharp bounds on the size of a digraph admitting an out set-magic indexer. We prove there exist no digraph admitting a unique out set-magic indexer. Also, we give a construction of an out set-magic indexed digraph from a directed path, directed cycle, tournament, inspoken wheel, and directed wind mill, etc., thereby showing their embeddings.

Notes:

cited By (since 1996)0

Cite this Research Publication

K. Abhishek and Germina, K. A., “Out Set-Magic Digraphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 7, no. 1, pp. 4173 – 4184, 2013.

## Publication Type:

Journal Article## Authors:

K. Abhishek; K. A. Germina## Source:

Journal of Discrete Mathematical Sciences and Cryptography, Volume 7, Issue 1, Number 84, p.4173 – 4184 (2013)## URL:

http://dx.doi.org/10.1080/09720529.2013.778458## Abstract:

Abstract Motivated by the papers of Peay [1], Acharya [2], and SedlaÄek [3], we introduce out set-magic indexer of digraphs: Let X be a nonempty set, 2 X denote the power-set of X. As in [2], given a digraph D with p vertices and q arcs, no-self loops, and parallel arcs, is labeled by assigning to each vertex an element from the set 2 X . An arc (x, y) from a vertex x to y is labeled with f âŠ•(x, y) = f (x) âŠ• f (y), where f (x) and f (y) are the values assigned to x and y, and â€œ âŠ• â€ is the symmetric difference of the sets. Such an assignment is called a set-indexer if f and f âŠ• are injective. A set-indexer f of a digraph D is called an out set-magic indexer if, U xâˆ¼e f âŠ•(e) = X, for all xâˆˆ V(D). A digraph admitting an out set-magic indexer is called an out set-magic digraph. In this paper we give some necessary conditions for a digraph to admit an out set-magic indexer, provide the sharp bounds on the size of a digraph admitting an out set-magic indexer. We prove there exist no digraph admitting a unique out set-magic indexer. Also, we give a construction of an out set-magic indexed digraph from a directed path, directed cycle, tournament, inspoken wheel, and directed wind mill, etc., thereby showing their embeddings.

## Notes:

cited By (since 1996)0

## Cite this Research Publication

K. Abhishek and Germina, K. A., “Out Set-Magic Digraphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 7, no. 1, pp. 4173 – 4184, 2013.## Related Research Publications