Edge fixed monophonic number of a graph

Abstract: For an edge xy in a connected graph G of order p ≥ 3, a set S V(G)is an xy-monophonic set of G if each vertex v Є V(G) lies on an x-u monophonic path or a y-u monophonic path for some element u in S. The minimum cardinality of an xy- monophonic set of G is defined as th...

Full description

Saved in:
Bibliographic Details
Main Authors: Titus,P., Vanaja,S. Eldin
Language:English
Published: Universidad Católica del Norte, Departamento de Matemáticas 2017
Subjects:
Online Access:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000300363
Tags: Add Tag
No Tags, Be the first to tag this record!