VisPro is a general-purpose visual language generation system, which can produce a wide range of diagrammatic visual programming languages (VPLs) based on Reserved Graph Grammar (RGG), a context sensitive graph grammar. This paper presents an approach to specify the semantic execution sequence of VPLs based on VisPro. In this approach, we use an ordering mechanism to facilitate the parsing form...

For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”. Mathematics Subject Classification: 05C78

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. c © 2003 Elsevier B...

A digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set or in-neighbor set of a vertex. A digraph is said to be reducible, if there are two vertices with the same out-neighbor set or the same in-neighbor set. In this paper, we prove that a strongly connected arc-transitive oriented graph is either reducible or super-connected. Furthermore, if this digraph is ...

A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In this paper, we introduce the concept of strong super edgemagic labeling as a particular class of super edge-magic labelings ∗Supported by Slovak VEGA Grant 1/4005/07. †Supported i...

In this paper, we propose a multi-branch neural network architecture named Coupled Modular Neural Network (CMNN). A CMNN is consisting of ? closely coupled sub-networks, where termed as the branching factor in paper. We call whole super-graph and each sub-network sub-graph. Each sub-graph stand-alone shares common block with other sub-graphs. To effectively leverage simple but easy-to-implement...

Let σ be a unimodular Pisot substitution over a d letter alphabet and let X1, . . . , Xd be the associated Rauzy fractals. In the present paper we want to investigate the boundaries ∂Xi (1 ≤ i ≤ d) of these fractals. To this matter we define a certain graph, the so-called contact graph C of σ. If σ satisfies Manuscrit reçu le 17 novembre 2004. The author was supported by project S8310 of the Au...

The purpose of this paper is to give convergence theorems both for closed convex set valued and relative fuzzy valued martingales, and suband supermartingales. These kinds of martingales, suband super-martingales are the extension of classical real valued martingales, suband super-martingales. Here we compare two kinds of convergences, in the Hausdor metric and in the Kuratowski-Mosco sense. We...

We give the elements of a theory of line bundles, their classification, and their connec-tions on super Riemann surfaces. There are several salient departures from the classicalcase. For example, the dimension of the Picard group is not constant, and there is nonatural hermitian form on Pic. Furthermore, the bundles with vanishing Chern numberaren’t necessarily flat, nor can every such bundle b...