an h-magic labeling in a h-decomposable graph g is a bijection f : v (g) ∪ e(g) → {1, 2, ..., p + q} such that for every copy h in the decomposition, σνεv(h) f(v) +  σeεe(h) f(e) is constant. f is said to be h-e-super magic if f(e(g)) = {1, 2, · · · , q}. a family of subgraphs h1,h2, · · · ,hh of g is a mixed cycle-decomposition of g if every subgraph hi is isomorphic to some cycle ck, for k ≥ ...

The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be real. To overcome this obstacle, several authors have recently defined and studied various Hermitian matrices digraphs or graphs. In work we unify previous offer new perspective on the subject by introducing concept monographs. Moreover, consider questions cospectrality.

Heterogeneous transfer learning has been proposed as a new learning strategy to improve performance in a target domain by leveraging data from other heterogeneous source domains where feature spaces can be different across different domains. In order to connect two different spaces, one common technique is to bridge feature spaces by using some co-occurrence data. For example, annotated images ...

A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the degree/diameter problem. Thus, our generalize...

A mixed graph is a that can be obtained from simple undirected by replacing some of the edges arcs in precisely one two possible directions. The Hermitian adjacency matrix G order n n×n H(G)=(hij), where hij=−hji=i (with i=−1) if there exists an arc vi to vj (but no vi), hij=hji=1 edge (and arcs) between and vj, hij=hji=0 otherwise (if are neither joined nor arc). Let λ1(G),λ2(G),…,λn(G) eigenv...