Definition 1. An m-linear function f which maps the m-fold cartesian product V m of a vector space V into some other vector space W is called alternating if f(v1, . . . , vm) = 0 whenever v1, . . . , vm ∈ V and vi = vj for i 6= j. We let ∧ (V ,W ) be the vector space of mlinear alternating functions mapping V m intoW . We then define ∧m V by the property that if f ∈ ∧m(V,W ) then there exists a...

It is known by Sahni [2] that the integral flow problem with overlapped bundles is NP-complete. We show that this problem remains NP-complete even if the bundles are disjoint. 1. Definition of the problem Let D = (N,E) be a directed graph with specified nodes s, t ∈ N . A mapping f : E → IN0 is called an integral flow, if for each node v ∈ N \{s, t}, ∑ (u,v)∈E f((u, v)) = ∑

Abstract In this article, we will design a computer program to solve graph colouring and visualize the variation of exam scheduling modelling at Binus University in graphs based on Welch Powell Algorithm. A vertex G = (V, E) is an F: V → N mapping where adjacent are different colours N, i.e. if edge (u, v) E, then F (u) not equal (v). The formulation problems regarding programs small experiment...

Let G = (V, E) be a simple graph with p vertices and q edges. For connected of diameter d, radio mean labeling is one to mapping f from V(G) N satisfying the condition for every μ, ν ∈ V (G). The span maximum integer that maps vertex G. number G, rmn(G) lowest taken over all labelings In this paper, we analyze some splitting graphs labeling.

a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

In this note, we extend Schiitzenberger’s evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged. Let G = ( V, E) be a simple undirected graph without loops; V is its set of vertices, and E its se...

Die Analyse realweltlicher Domänen lässt mitunter eine Reihe verschiedener Abstraktionsmöglichkeiten erkennen. Deren Abbildung mit Hilfe gängiger Sprachen der konzeptionellen Modellierung führt teilweise zu erheblichen Problemen, die kaum thematisiert werden. So kann die scheinbar offenkundige Bedeutung von Spezialisierungsbeziehungen zu kontra-intuitiven Konsequenzen führen, die die Qualität v...

A pseudo-Euclidean space (R, μ) is such a Euclidean space R associated with a mapping μ : − → V x → x − → V for x ∈ R, and a linear isometry T : (R, μ) → (R, μ) is such a linear isometry T : R → R that Tμ = μT . In this paper, we characterize curvature of s-line, particularly, Smarandachely embedded graphs and determine linear isometries on (R, μ).

A signed graph is a simple with two types of edges: positive and negative. homomorphism from G to another H mapping \(\varphi : V(G) \rightarrow V(H)\) that preserves vertex adjacencies balance closed walks (the the parity number negative edges). The chromatic \(\chi _s(G)\) order smallest such there H.

Organelle transport by myosin-V is down-regulated during mitosis, presumably by myosin-V phosphorylation. We used mass spectrometry phosphopeptide mapping to show that the tail of myosin-V was phosphorylated in mitotic Xenopus egg extract on a single serine residue localized in the carboxyl-terminal organelle-binding domain. Phosphorylation resulted in the release of the motor from the organell...