Edge and vertex intersection of paths in a graph
Author & Affiliation:
S. SOMASUNDARAM
Department of Mathematics, Manomaniam Sundaranar University, Tirunelveli - 627 012 (INDIA)
A. NAGARAJAN nagarjuan.voc@gmail.comm
Department of Mathematics, V.O. Chidambram College, Tuticorin - 628 008 (INDIA)
G. MAHADEVAN (gmaha2003@yahoo.co.in
Department of Mathematics, Gandhigram Rural University, Gandhigram - 624 302 (INDIA)
Keyword:
Edge , vertex intersection, paths in a graph
Issue Date:
August 2009
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
Pages:
315-318
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
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 315-318, 2018Copy 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 315-318, 2018Available from: https://www.ultrascientist.org/paper/1190/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
