相关论文: Uniformly resolvable decompositions of $K_v$ into …

In this paper we consider uniformly resolvable decompositions of the complete graph K_v into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in…

In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set $\mathcal H$. We…

In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases…

We consider the existence problem of uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one…

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class is $K_2$ and…

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a partial solution for the case in which all resolution classes are either…

In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.

Let $K_v$ denote the complete graph of order $v$ and $K_v - I$ denote $K_v$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_v$ and $K_v-I$ into $r$ classes containing only copies of $3$-stars and…

In this paper it is established that a decomposition of a 3-uniform hypergraph K_v^{(3)} into a special kind of hypergraph K_4^{(3)}+e exists if and only if v\equiv 0,1,2 (mod 5) and v\geq 7.

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

We consider edge decompositions of $K_v^{(3)}-I$, the complete 3-uniform hypergraph of order $v$ minus a 1-factor (parallel class, packing of $v/3$ disjoint edges). We prove that a decomposition into tight 6-cycles exists if and only if…

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case…

The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair of distinct vertices $x$ and $y$. For a given directed graph, $D$, the…

This article explores a new way to obtain the optimal decomposition of a complete graph of order 18 and 19 into cliques of order 3 and 4.

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

A uniquely $k$-colourable graph is a graph with exactly one partition of the vertex set into at most $k$ colour classes. Here, we investigate some constructions of uniquely $k$-colourable graphs and give a construction of $K_k$-free…

We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…