The undeformed limit of the dilute two-color braid-monoid algebra gives a natural basis for the description of spin-1/2 ladder models, and allows different Baxterization Ansätze. Based on this observation we find the complete classification of exactly soluble generalized isotropic spin-1/2 ladder models.

we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...

Let $A$ be a commutative ring with nonzero identity, and $1leq n

Let β(G) and Γ(G) be the independence number and the upper domination number of a graphG, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of graphs as strongly perfect graphs, absorbantly perfect graphs, and circular arc graphs. In this article, we present a characterization of Γ-per...

Node embeddings are increasingly used in various analysis tasks of networks due to their excellent dimensional compression and feature representation capabilities. However, most researchers’ priorities have always been link prediction, which leads signed network clustering being under-explored. Therefore, we propose an asymmetric ladder-shaped architecture called RGCLN based on multi-relational...