eng
Ansari Education and Research Society
Journal of Ultra Scientist of Physical Sciences
August 2009
21
2
353
356
jusps-A
1194
article
On randomly Kn-packable graphs
S. SOMASUNDARAM
1
A. Nagarhan (nagarjan.voc@gmail.com)
2
G. MAHADEVAN (gmaha2003@yahoo.com)
3
Department of Mathematics, Manomaniam Sunderanar University, Tiirunelveli- 627 012 (INDIA)
Department of Mathematics, V.O. Chidambaram College, Tuticorin - 628 008 (INDIA)
Department of Mathematics, Gandhigram Rural University, Gandhigram - 623 304 (INDIA)
<p style="text-align: justify;">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 K<sub>n</sub> - packing of a graph.</p>
http://www.ultrascientist.org/paper/1194/
On randomly
Kn-packable
graphs