Signed (b,k) Edge Covers in Graphs

Overall, IFECL and ASWPL needed a more flexible business management system that would provide real-time insight into business metrics, streamline processes, and significantly

A set D of vertices of a connected graph G = (V; E) is called a connected k-dominating set of G if every vertex in V –D is within distance k from some vertex of D, and the

In this section, we determine the signed double k- Roman domination number of some classes of graphs including complete bipartite graphs and cycles.... [3] determined the signed

In this section, we study γ s  (K m,n,p )-functions with the property that the difference between the number of negative edges at every two vertices in the same partite set is at most

Assign −1 and +1 to the edges of this Eulerian circuit, alternatingly to obtain a signed matching g with the desired

In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter... The k-tuple domination num- ber, denoted by γ ×k (

Since every connected component in Category (a) has at least one vertex of odd degree and there are exactly n−2α  ( G) vertices of odd degree in Category (a), according to Lemma 4,

Wang, The signed star domination numbers of the Cartesian product graphs, Dis- crete Applied Math. Xu, On signed edge domination numbers of graphs,