The hull number of an oriented graph-Reference-Cited by-同舟云学术

The hull number of an oriented graph

Published:2003 Issue:36 Volume:2003 Page:2265-2275
ISSN:0161-1712
Container-title:International Journal of Mathematics and Mathematical Sciences
language:en
Short-container-title:International Journal of Mathematics and Mathematical Sciences

Author:

Chartrand Gary¹,Fink John Frederick²,Zhang Ping¹

Affiliation:

1. Department of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA

2. Department of Mathematics, The University of Michigan-Dearborn, Dearborn, MI 48128-1491, USA

Abstract

We present characterizations of connected graphsGof ordern≥2for whichh+(G)=n. It is shown that for every two integersnandmwith1≤n−1≤m≤(n2), there exists a connected graphGof ordernand sizemsuch that for each integerkwith2≤k≤n, there exists an orientation ofGwith hull numberG.

Funder

Western Michigan University

Publisher

Hindawi Limited

Subject

Mathematics (miscellaneous)

Link

http://downloads.hindawi.com/journals/ijmms/2003/626098.pdf

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hull and geodetic numbers for some classes of oriented graphs;Discrete Applied Mathematics;2021-05

2. Hull and Geodetic Numbers for Some Classes of Oriented Graphs;Electronic Notes in Theoretical Computer Science;2019-08

3. Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs;SIAM Journal on Discrete Mathematics;2016-01

4. On the hull number of some graph classes;Theoretical Computer Science;2013-03

5. Computational Complexity;Geodesic Convexity in Graphs;2013