Decomposition of symmetric digraphs into directed paths
Author:
V. Maheswari1 and A. Nagarajan2
Affiliation:
1A.P.C Mahalaxmi College for Women, Turicorin Tamil Nadu India
2V.O. Chidambaram College Turicorin Tamil Nadu India
Email:-mahi_raj2005@yahoo.com
Keyword:
Decomposition; product graphs; symmetric digraphs.
AMS subject classification: 05C70.
Issue Date:
April 2013
Abstract:
In this paper, we discuss that some symmetric digraphs are directed path decomposable. Moreover, it is proved that if m ³ 3, t is odd, 3 £ t £ mn-1, gcd(m(m-1),t) £ m and tm(m-1)n, then Pt+1, a directed path of length t, decomposes (Kmo K), where o denotes the wreath product of graphs. Further, it is proved that if both t and m>=3 are odd, , gcd and ((m(m-1)/2,t) <=m and t(m(m-1)/2)n then Pt+1. decomposes Km o Kn
Pages:
265-276
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
V. Maheswari1 and A. Nagarajan2 , "Decomposition of symmetric digraphs into directed paths ", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 1, Page Number 265-276, 2016Copy the following to cite this URL:
V. Maheswari1 and A. Nagarajan2 , "Decomposition of symmetric digraphs into directed paths ", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 1, Page Number 265-276, 2016Available from: https://www.ultrascientist.org/paper/708/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
