The hull number of an oriented graph

We present characterizations of connected graphs G of order n≥2 for which h+(G)=n. It is shown that for every two integers n and m with 1≤n−1≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2≤k≤n, there exists an orientation of G with hull number G....

Full description

Saved in:
Bibliographic Details
Main Authors: Gary Chartrand, John Frederick Fink, Ping Zhang
Format: Article
Language:English
Published: Wiley 2003-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/S0161171203210577
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present characterizations of connected graphs G of order n≥2 for which h+(G)=n. It is shown that for every two integers n and m with 1≤n−1≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2≤k≤n, there exists an orientation of G with hull number G.
ISSN:0161-1712
1687-0425