We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Smarandache Directionally n-Signed Graphs -- A Survey.
- Authors
Reddy, P. Siva Kota
- Abstract
Let G = (V,E) be a graph. By directional labeling (or d-labeling) of an edge x = uv of G by an ordered n-tuple (a1, a2, ..., an), we mean a labeling of the edge x such that we consider the label on uv as (a1, a2, ..., an) in the direction from u to v, and the label on x as (an, an-1, ..., a1) in the direction from v to u. In this survey, we study graphs, called (n, d)-sigraphs, in which every edge is d-labeled by an n-tuple (a1, a2, ..., an), where ak ∈ {+,-}, for 1 ≤ k ≤ n. Several variations and characterizations of directionally n-signed graphs have been proposed and studied. These include the various notions of balance and others.
- Subjects
SMARANDACHE function; GRAPH theory; SURVEYS; GRAPH labelings; ANALYSIS of variance; SMARANDACHE notions; MATHEMATICAL analysis
- Publication
International Journal of Mathematical Combinatorics, 2013, Vol 2, p34
- ISSN
1937-1055
- Publication type
Article