A Roman dominating function (RDF) on a graph $G$ is a function $f : V (G) to {0, 1, 2}$satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least onevertex $v$ for which $f(v) = 2$. A Roman dominating function $f$ is called an outer-independentRoman dominating function (OIRDF) on $G$ if the set ${vin Vmid f(v)=0}$ is independent.The (outer-independent) Roman dom...

The total graph is built by joining the to its line means of incidences. We introduce a similar construction for signed graphs. Under two defnitions graph, we defne corresponding and show that it stable under switching. consider balance, frustration index number, largesteigenvalue. In regular case compute spectrum adjacency matrix spectra certain compositions, determine some with exactly main e...

This paper presents an ongoing project about the symbolic translation from Italian to Italian Signed Language (LIS) in the rail stations domain. We describe some technical issues in the generation side of the translation, i.e. the use of XML templates for microplanning, the implementation of some LIS linguistic features in the grammar.

Definition of dominating function on a fractional graph G has been introduced. Fractional parameters such as domination number and upper defined. Domination with fuzzy Intuitionistic environment, have found by formulating Linear Programming Problem.

In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and weak n-connected in fuzzy graphs is introduced. current work, triple-connected dominating modified to an nctpkD(G) number γnctpD(G). New definitions are compared with old ones. Strong obtained. The results those sets discussed spanning graphs, arcs, sets, generalization complete, conn...

In this paper I explore the role of gesture in the development of signed languages. Using data from American Sign Language, Catalan Sign Language, French Sign Language, and Italian Sign Language, as well as historical sources describing gesture in the Mediterranean region, I demonstrate that gesture enters the linguistic system via two distinct routes. In one, gesture serves as a source of lexi...

OF THE DISSERTATION Applications and Variations of Domination in Graphs by Paul Andrew Dreyer, Jr. Dissertation Director: Fred S. Roberts In a graph G = (V, E), S ⊆ V is a dominating set of G if every vertex is either in S or joined by an edge to some vertex in S. Many different types of domination have been researched extensively. This dissertation explores some new variations and applications...

Let G be a graph of order n. For every v ∈ V (G), let EG(v) denote the set of all edges incident with v. A signed k-submatching of G is a function f : E(G) −→ {−1, 1}, satisfying f(EG(v)) ≤ 1 for at least k vertices, where f(S) = ∑ e∈S f(e), for each S ⊆ E(G). The maximum of the value of f(E(G)), taken over all signed k-submatching f of G, is called the signed k-submatching number and is denote...