Let G be a multipartite multigraph without loops. Then G is said to be internally fair if its edges are shared as evenly as possible among all pairs of its partite sets. An internally fair factorization of G is an edge-decomposition of G into internally fair regular spanning subgraphs. A holey factor of G is a regular subgraph spanning all vertices but one partite set. An internally fair holey ...

Regular Path Queries (RPQs) are a type of graph query where answers are pairs of nodes connected by a sequence of edges matching a regular expression. We study the techniques to process such queries on a distributed graph of data. While many techniques assume the location of each data element (node or edge) is known, when the components of the distributed system are autonomous, the data will be...

We use a regular arrangement of kirigami elements to demonstrate an inverse design paradigm for folding a flat surface into complex target configurations. We first present a scheme using arrays of disclination defect pairs on the dual to the honeycomb lattice; by arranging these defect pairs properly with respect to each other and choosing an appropriate fold pattern a target stepped surface ca...

A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to the set of colours appearing on the edges incident with w. Let ndi(G) be the least number of colours required for a proper neighbour-distinguishing edge colouring of G. We prove that for d ≥ 4, a random d-regular grap...

‎let $v$ be a vector space over a field $f$ of characteristic $pgeq 0$ and let‎ ‎$t$ be a regular subgroup of the affine group $agl(v)$‎. ‎in the finite dimensional case we show that‎, ‎if $t$ is abelian or $p>0$‎, ‎then $t$ is unipotent‎. ‎for $t$ abelian‎, ‎pushing forward some ideas used in [a‎. ‎caranti‎, ‎f‎. ‎dalla volta and m‎. ‎sala‎, ‎abelian regular subgroups of the affine group and r...

Auslander’s depth formula for pairs of Tor-independent modules over a regular local ring, depth(M ⊗R N) = depth M + depth N − depthR, has been generalized in several directions; most significantly it has been shown to hold for pairs of Tor-independent modules over complete intersection rings. In this paper we establish a depth formula that holds for every pair of Tate Tor-independent modules ov...

in this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. by using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. moreover, we investigate the ...

Given a set P of n points in R, let d1 > d2 > . . . denote all distinct inter-point distances generated by point pairs in P . It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d1 whose every vertex belongs to P . We extend this result by showing that for any k the number of d-dimensional regular simplices of edge length dk ...

We introduce a new variant of tight closure and give an interpretation of adjoint ideals via this tight closure. As a corollary, we prove that a log pair (X,∆) is plt if and only if the modulo p reduction of (X,∆) is divisorially F-regular for all large p ≫ 0. Here, divisorially F-regular pairs are a class of singularities in positive characteristic introduced by Hara and Watanabe [HW] in terms...

The graph metric of an undirected graph can be represented by a symmetric matrix in which each entry is the graph distance between the corresponding nodes, i.e., the shortest path distance between them. This article presents an improved all-pairs Dijkstra’s algorithm for computing the graph metric on an undirected weighted graph. Taking the advantage of the symmetric property of the graph metri...