eng Ansari Education and Research Society Journal of Ultra Scientist of Physical Sciences August 2009 21 2 315 318 jusps-A 1190 article Edge and vertex intersection of paths in a graph S. SOMASUNDARAM 1 A. NAGARAJAN nagarjuan.voc@gmail.comm 2 G. MAHADEVAN (gmaha2003@yahoo.co.in 3 Department of Mathematics, Manomaniam Sundaranar University, Tirunelveli - 627 012 (INDIA) Department of Mathematics, V.O. Chidambram College, Tuticorin - 628 008 (INDIA) Department of Mathematics, Gandhigram Rural University, Gandhigram - 624 302 (INDIA) <p style="text-align:justify">In this paper we investigate some parameters &micro;<sub>0</sub>, &micro;<sub>1</sub>(&micro;<sub>0</sub>&#39;, &micro;<sub>1</sub>&#39;) for vertex (edge) intersection of paths in a graph G. &micro;<sub>0</sub>(G) (&micro;<sub>1</sub>(G)) is the minimum number of vertices (edges) of all graphs H such that G is the intersection graph of some path cover of a graph H. &micro;<sub>0</sub>&#39;, &micro;<sub>1</sub>&#39; are define analogously for edge intersection graph</p> https://www.ultrascientist.org/paper/1190/ Edge vertex intersection paths in a graph