let $g=(v‎, ‎e)$ be a graph with $p$ vertices and $q$ edges‎. ‎an emph{acyclic‎ ‎graphoidal cover} of $g$ is a collection $psi$ of paths in $g$‎ ‎which are internally-disjoint and cover each edge of the graph‎ ‎exactly once‎. ‎let $f‎: ‎vrightarrow {1‎, ‎2‎, ‎ldots‎, ‎p}$ be a bijective‎ ‎labeling of the vertices of $g$‎. ‎let $uparrow!g_f$ be the‎ ‎directed graph obtained by orienting the...

‎let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$‎. ‎a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$‎. ‎in this paper we introduce a new kind of graph energy for the binary labeled graph‎, ‎the labeled graph energy $e_{l}(g)$‎. ‎it depends on the underlying graph $g$...

Introduction: Applying of a new indicator in food packaging can be effective to inform consumers about the freshness and quality of the products. Materials and Methods: In the current study, a new milk freshness label was investigated containing beetroot color and multi layers of polystyrene. The label characteristics were investigated by estimating color number, release test, and scanning ele...

Multi-label classification has gained significant attention during recent years, due to the increasing number of modern applications associated with multi-label data. Despite its short life, different approaches have been presented to solve the task of multi-label classification. LIFT is a multi-label classifier which utilizes a new strategy to multi-label learning by leveraging label-specific ...

label switching technology is a flexible and high performance method for forwarding layer three packets that are mapped to layer two flows. each label switch router, lsr, needs a specific label for every flow, where the number of labels depends on the mapping and granularity of flows. data and control driven methods are the most significant and popular methods in label mapping policy. the above...

Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....

We present a force-based simulated annealing algorithm to heuristically solve the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point-feature in the plane, the task is to find a labeling for a largest subset of the labels. A labeling is a placement such that none of the labels overlap and each is placed at its point-feature. The abs...

in this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. after obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. the number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. by exploiting the order, we label the s...

In this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. After obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. The number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. By exploiting the order, we label the s...