If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

Abstract To achieve the goal of sustainable employment, considering profile Portuguese working population (PWP), is needed a range strategies to ensure long, productive, and careers allied with better quality life, health, wellbeing, but also public health policies grounded on scientifically validated reliable data. This possible through comprehensive system approach that ensures workers will b...

A low molecular weight RNA was isolated from human cells infected with adenovirus 2 and its nucleotide sequence deduced to be ,G-G-G-C-A-C-U-C-U-U-C-C-G-U-G-G-UC-U-G-G-U-G-G-A-U-A-A-A-U-U-C-G-C-A-A-G-G-G-U-AU-C-A-U-G-G-C-(G-U-G-G-A-C-G-A-C-C)-G-G-G-G-U-UC-G-A-A-C-C-C-C-G-G-A-U-C-C-G-U-G-A-U-C-C-A-U-GC-G-G-U-U-A-C-C-G-U-C-C-G-C-C-G-C-C-C-G-U-G-C-GU-C-G-A-A-C-C-C-A-G-G-U-G-U-G-C-G-A-C-G-U-C-AG-A-...

The nucleotide sequence of rainbow trout (Salmo gairdneri) 5.8 S rRNA was determined to be p(C)-A-A-C-U-C-UIO LO SO Um-A-G-C-G-G-U(m)-G-G-A-U-C-A-C-U-C-G-G-C-U-C-G-U411 51, G-C-G-U-C-G-A-U-G-A-A-G-A-A-C-G-C-A-G-C-G-C-U-A-G80 ill C-(~V)-G-C-G-A-G-A-A-C-U-A-A-U-G-JI-G-A-A-U-U-Gm-C-AX0 911 1,N, G-G-A-C-A-C-A-U-U-G-A-U-C-A-U-U-G-A-C-A-C-U-U-C-G1 LO lL,l A-A-C-G-C-A-C-U-U-U-G-C-G-G-C-C-C-C-A-G-G-G-G...

the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...

Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.