Vol. 5 No. 2 (2018): Vol 5, Iss 2, Year 2018
Articles

P_4-DECOMPOSITION OF LINE AND MIDDLE GRAPH OF SOME GRAPHS

Vanitha R
PG and Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore – 641 029, Tamil Nadu, India.
Vijayalakshmi D
PG and Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore – 641 029, Tamil Nadu, India.
Mohanappriya G
PG and Research Department of Mathematics, Kongunadu Arts and Science College, Coimbatore – 641 029, Tamil Nadu, India.
Published December 30, 2018
How to Cite
R, V., D, V., & G, M. (2018). P_4-DECOMPOSITION OF LINE AND MIDDLE GRAPH OF SOME GRAPHS. Kongunadu Research Journal, 5(2), 1-6. Retrieved from https://krjournal.com/index.php/krj/article/view/345

Abstract

A decomposition of a graph G is a collection of edge-disjoint subgraphs G1,G2……Gm of G such that every edge of G belongs to exactly one Gi, 1 ≤ i ≤ m. E(G) = E(G1) ∪ E(G2) ∪ ….∪E(Gm). If every graph Giis a path then the decomposition is called a path decomposition. In this paper, we have discussed the P4-decomposition of line and middle graph of Wheel graph, Sunlet graph, Helm graph. The edge connected planar graph of cardinality divisible by 3 admits a P4 -decomposition.

Downloads

Download data is not yet available.