Published November 1, 2012 | Version v1

On the Forcing Hull and Forcing Monophonic Hull Numbers of Graphs

Authors/Creators

Description

By a graph G = (V,E), we mean a finite undirected connected graph without loops or multiple edges.

Files

ForcingHull.pdf

Files (224.2 kB)

Name Size
md5:8f634d14019bf5a7384269f644208a34
224.2 kB Preview Download