AUTHOR AND 
S. SOMASUNDARAM 
KEYWORDS: 
Edge , vertex intersection, paths in a graph 
Issue Date: 
August 2009 
Pages: 
315318 
ISSN: 
23198044 (Online) – 2231346X (Print) 
Source: 
Vol.21 – No.2 
Click Here Download PDF 

DOI: 
juspsA 
ABSTRACT:
In this paper we investigate some parameters µ0, µ1(µ0′, µ1′) for vertex (edge) intersection of paths in a graph G. µ0(G) (µ1(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. µ0′, µ1′ are define analogously for edge intersection graph
Copy the following to cite this Article:
S. Somasundaram; A. N. Nagarjuan.voc@gmail.comm; G. Mahadevan, “Edge and vertex intersection of paths in a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 315318, 2018
Copy the following to cite this URL:
S. Somasundaram; A. N. Nagarjuan.voc@gmail.comm; G. Mahadevan, “Edge and vertex intersection of paths in a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 315318, 2018
Available from: http://www.ultrascientist.org/paper/1190/
In this paper we investigate some parameters µ_{0}, µ_{1}(µ_{0}‘, µ_{1}‘) for vertex (edge) intersection of paths in a graph G. µ_{0}(G) (µ_{1}(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. µ_{0}‘, µ_{1}‘ are define analogously for edge intersection graph