首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的笛卡儿积的测地数
引用本文:叶永升,吕长虹,刘庆敏.图的笛卡儿积的测地数[J].应用数学,2007,20(1):158-163.
作者姓名:叶永升  吕长虹  刘庆敏
作者单位:1. 淮北煤炭师范学院数学系,安徽,淮北,235000;华东师范大学数学系,上海,200062
2. 华东师范大学数学系,上海,200062
基金项目:国家自然科学基金;上海市科委资助项目;安徽省自然科学基金
摘    要:对于图G内的任意两点u和v,u-v测地线是指u和v之间的最短路.I(u,v)表示位于u-v测地线上所有点的集合,对于.S∈V(G),I(S)表示所有I(u,v)的并,这里“u,v∈.S.G的测地数g(G)是使I(S)=V(G)的点集.S的最小基数.在这篇文章,我们研究G×K3的测地数和g(G)与g(G×K3)相等的充分必要条件,还给出了T×Km和Cn×Km的测地数,这里T是树.

关 键 词:凸集  笛卡儿积  测地线  测地数
文章编号:1001-9847(2007)01-0158-06
修稿时间:2006-06-19

The Geodetic Numbers of Cartesian Products of Graphs
YE Yong-sheng,LV Chang-hong,LIU Qing-min.The Geodetic Numbers of Cartesian Products of Graphs[J].Mathematica Applicata,2007,20(1):158-163.
Authors:YE Yong-sheng  LV Chang-hong  LIU Qing-min
Institution:1. Department of Mathematics, Huaibei Coal Industry Teachers College, Huaibei 235000, China 2. Department of Mathematics, East China Normal University, Shanghai 200062, China
Abstract:For any two vertices u and v in a graph G,a u-v geodesic is the shortest path between u and v.Let I(u,v) denote the set of all vertices lying on a u-v geodesic.For a vertex subset S,let I(S) denote the union of all I(u,v) for u,v∈S.The geodetic number g(G) of a graph G is the minimum cardinality of a set S with I(S)=V(G).In this paper,a sufficient and necessary condition for the equality of g(G) and g(G×K3) is presented,and for a tree T,we give the geodetic number of T×Km and Cn×Km.
Keywords:Convex set  Cartesian product  Geodesic  Geodetic number
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号