Related papers: Hypergraph Characterization of Fusion Rings

We focus on the geometrical reformulation of free higher spin supermultiplets in $4\rm{D},~\mathcal{N}=1$ flat superspace. We find that there is a de Wit-Freedman like hierarchy of superconnections with simple gauge transformations. The…

Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…

Praeger-Xu graphs are connected, symmetric, 4-regular graphs that are unusual both in that their automorphism groups are large, and in that vertex stabilizer subgroups are also large. Determining number and distinguishing number are…

Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…

For a connected graph $G=(V,E)$, a matching $M\subseteq E$ is a matching cut of $G$ if $G-M$ is disconnected. It is known that for an integer $d$, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of…

In this paper, we define a new hypergraph $\mathcal{H(V,E)}$ on a loop $L$, where $\mathcal{V}$ is the set of points of the loop $L$ and $\mathcal{E}$ is the set of hyperedges $e=\{x,y,z\}$ such that $x,y$ and $z$ associate in the order…

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…

In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…

For $\ell \geq 3$, an $\ell$-uniform hypergraph is disperse if the number of edges induced by any set of $\ell+1$ vertices is 0, 1, $\ell$ or $\ell+1$. We show that every disperse $\ell$-uniform hypergraph on $n$ vertices contains a clique…

A hypergraph is "$d$-degenerate" if every subhypergraph has a vertex of degree at most $d$. A greedy algorithm colours every such hypergraph with at most $d+1$ colours. We show that this bound is tight, by constructing an $r$-uniform…

In the spirit of the generalized holographic conjecture, we explore a relationship between the bulk and boundary properties of non-interacting massive Dirac fermions living on a flexible surface, such as a sheet of graphene. We demonstrate…

This paper discusses the complete structure of the (bull, diamond)-free graphs. As an application of that, we give the characterization of the partitionable (bull, diamond)-free graphs. Moreover, we show that such a partition for a…

A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set $\{H_1', H_2'\}$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that $H_1'\cong H_1$ and $H_2'\cong H_2$. Whilst the problem of…

In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs…

We construct for all $ k\in \mathbb{N} $ a $ k $-edge-connected digraph $ D $ with $ s,t\in V(D) $ such that there are no edge-disjoint $ s \rightarrow t $ and $t\rightarrow s $ paths. We use in our construction "self-similar" graphs which…

In the context of holography, we analyse aspects of supersymmetric geometries based on two-dimensional orbifolds known as spindles. By analysing spin$^c$ spinors on a spindle with an azimuthal rotation symmetry we show that under rather…

Let $R$ be a ring with unity. The non-zero divisor graph of $R$, $\Phi(R)$, is the graph with vertex set $R\backslash \{0,1,-1\}$, and two vertices $x$ and $y$ are adjacent if and only if either $xy$ or $yx$ is non-zero. In this article we…

We consider three types of rings of supersymmetric polynomials: polynomial ones $\Lambda_{m,n}$, partially polynomial $\Lambda_{m,n}^{+y}$ and Laurent supersymmetric rings $\Lambda_{m,n}^{\pm}$. For each type of rings we give their…