The Connected Monophonic Number of a Graph


For a connected graph G = (V, E), a monophonic set of G is a set M � V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. The monophonic number m (G) of G is the minimum order of its monophonic sets and any monophonic set of order m (G) is a minimum monophonic set of G. A connected monophonic set of a graph… (More)
DOI: 10.1007/s00373-012-1260-1


4 Figures and Tables

Slides referencing similar topics