On the hull sets and hull number of the cartesian product of graphs

被引：14

作者：

Cagaanan, GB ^{[1
]}

Canoy, SR

机构：

[1] MSU IIT, Sch Engn Technol, Related Subjects Dept, Iligan 9200, Philippines

[2] Iligan Inst Technol, Mindanao State Univ, Dept Math, Iligan 9200, Philippines

来源：

DISCRETE MATHEMATICS | 2004年 / 287卷 / 1-3期

关键词：

Cartesian product; convex hull; convex set; hull number; hull set;

D O I：

10.1016/j.disc.2004.06.014

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For a connected graph G, the convex hull of a subset C of V(G) is defined as the smallest convex set in G containing C. A subset C of V (G) is a hull set in G if the convex hull of C is V (G). The cardinality of a minimum hull set in G is called the hull number of G. Chartrand, Harary and Zhang (2000) presented the hull number of the Cartesian product of a nontrivial connected graph and K-2. In this paper, we give the hull number of the Cartesian product of any two connected graphs. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：141 / 144

页数：4