The hull number of an oriented graph

Gary Chartrand, John Frederick Fink and Ping Zhang

International Journal of Mathematics and Mathematical Sciences, 2003, vol. 2003, 1-11

Abstract:

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 ≤ ( n 2 ) , 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 .

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2003/626098.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2003/626098.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:626098

DOI: 10.1155/S0161171203210577

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().