On randomly Kn-packable graphs
Author & Affiliation:
S. SOMASUNDARAM
Department of Mathematics, Manomaniam Sunderanar University, Tiirunelveli- 627 012 (INDIA)
A. Nagarhan (nagarjan.voc@gmail.com)
Department of Mathematics, V.O. Chidambaram College, Tuticorin - 628 008 (INDIA)
G. MAHADEVAN (gmaha2003@yahoo.com)
Department of Mathematics, Gandhigram Rural University, Gandhigram - 623 304 (INDIA)
Keyword:
On randomly , Kn-packable , graphs
Issue Date:
August 2009
Abstract:
A graph G is said to be packable by the graph F if its edges can be partitioned into copies of F. It is randomly packable if what remains of deletion of edges of a proper subgraph that is F packable is also F-packable. In this paper we investigate the properties of W (Y) where Y is a unique Kn - packing of a graph.
Pages:
353-356
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
S. Somasundaram; A. Nagarhan; G. Mahadevan, "On randomly Kn-packable graphs", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 353-356, 2018Copy the following to cite this URL:
S. Somasundaram; A. Nagarhan; G. Mahadevan, "On randomly Kn-packable graphs", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 353-356, 2018Available from: https://www.ultrascientist.org/paper/1194/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
