AbstractAn (s,t)-directed star decomposition of a directed multigraph is a partition of the ars into directed stars, each having s arcs into the center and t arcs out of the center. We determine necessary and sufficient conditions for a directed complete multigraph to have an (s,t)-directed star decomposition. We futher determine necessary abd sufficient conditions for a regular directed symmetric graph to have such a decomposition in which each vertex is the center of the same number of stars
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
summary:Let $G$ be a multigraph. The star number ${\mathrm s}(G)$ of $G$ is the minimum number of ...
AbstractWe show that a necessary and sufficient condition for the existence of an Sk-factorization o...
AbstractAn (s,t)-directed star decomposition of a directed multigraph is a partition of the ars into...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is t...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
summary:Let $G$ be a multigraph. The star number ${\mathrm s}(G)$ of $G$ is the minimum number of ...
AbstractLet G be a vertex-disjoint union of directed cycles in the complete directed graph Dt, let |...
The multistar $ S^{w_1,...,w_n}$ is the multigraph whose underlying graph is an $n$-star and the mul...
In Chapter 1, we will introduce the definitions and the notations used throughout this thesis. We wi...
A graph is a discrete mathematical structure that consists of a set of vertices and a set of edges b...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
summary:Let $G$ be a multigraph. The star number ${\mathrm s}(G)$ of $G$ is the minimum number of ...
AbstractWe show that a necessary and sufficient condition for the existence of an Sk-factorization o...
AbstractAn (s,t)-directed star decomposition of a directed multigraph is a partition of the ars into...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is t...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
summary:Let $G$ be a multigraph. The star number ${\mathrm s}(G)$ of $G$ is the minimum number of ...
AbstractLet G be a vertex-disjoint union of directed cycles in the complete directed graph Dt, let |...
The multistar $ S^{w_1,...,w_n}$ is the multigraph whose underlying graph is an $n$-star and the mul...
In Chapter 1, we will introduce the definitions and the notations used throughout this thesis. We wi...
A graph is a discrete mathematical structure that consists of a set of vertices and a set of edges b...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
summary:Let $G$ be a multigraph. The star number ${\mathrm s}(G)$ of $G$ is the minimum number of ...
AbstractWe show that a necessary and sufficient condition for the existence of an Sk-factorization o...