Add to ORKGLet Pk+1 denote a path of length k, Sm denote a star with m edges, and Kn(λ) denote the complete multigraph on n vertices in which every pair of distinct vertices is joined by λ edges. In this paper, we have obtained the necessary conditions for a {Pk+1, Sm}-decomposition of Kn(λ) and proved that the necessary conditions are also sufficient when k = 6 and m = 4.The second author is supported by the University of New Delhi under the grant no: F. MRP-6292/15, (SERO/UGC).Publisher's Versio
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph K...
Let T be a tree with m edges. A well-known conjecture of Ringel states that every tree T with m edge...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
AbstractLet Pk+1 denote a path of length k and let Sk+1 denote a star with k edges. As usual Kn deno...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
AbstractLet Pk+1 denote a path of length k and let Sk+1 denote a star with k edges. As usual Kn deno...
Let $C_{k}$ and $P_{k}$ denote a cycle and a path on $k$ vertices, respectively. In this paper, we o...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
The main objective of this thesis is to review and expand the study of graph decomposability. An H-d...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
Copyright © 2014 Ancykutty Joseph and Jinitha Varughese. This is an open access article distributed ...
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph K...
Let T be a tree with m edges. A well-known conjecture of Ringel states that every tree T with m edge...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
AbstractLet Pk+1 denote a path of length k and let Sk+1 denote a star with k edges. As usual Kn deno...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let $P_{k+1}$ denote a path of length $k$, $C_{\ell}$ denote a cycle of length $\ell$, and $K_{n}(\l...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
AbstractLet Pk+1 denote a path of length k and let Sk+1 denote a star with k edges. As usual Kn deno...
Let $C_{k}$ and $P_{k}$ denote a cycle and a path on $k$ vertices, respectively. In this paper, we o...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
The main objective of this thesis is to review and expand the study of graph decomposability. An H-d...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
Copyright © 2014 Ancykutty Joseph and Jinitha Varughese. This is an open access article distributed ...
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph K...
Let T be a tree with m edges. A well-known conjecture of Ringel states that every tree T with m edge...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...