路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)

黄怡; 陈美润

您当前的位置：

首页 >

文章列表页 >

路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)

更新时间：2026-01-21

- 路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 26, Issue 1, Pages: 33-37(2009)
- 作者机构：
  
  1. 新疆石油学院
  2. 厦门大学数学科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2009
- 稿件说明：
移动端阅览
[1]黄怡,陈美润.路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)[J].新疆大学学报(自然科学版),2009,26(01):33-37.

黄怡, 陈美润. 路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(1): 33-37.
[1]黄怡,陈美润.路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)[J].新疆大学学报(自然科学版),2009,26(01):33-37. DOI：

黄怡, 陈美润. 路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(1): 33-37. DOI：

摘要

强有向图D中任意两个点u

v的强距离sd(u

v)定义为D中包含u和v的最小有向强子图Duv的大小(弧的数目).D中一点u的强离心率se(u)定义为u到其他顶点的强距离的最大值.强有向图D的强半径srad(D)(相应的强直径sdiam(D))定义为D中所有顶点强离心率的最小值(相应的最大值).无向图G的最小定向强半径srad(G)(相应的最大定向强半径SRAD(G))定义为D中所有强定向的强半径的最小值(相应的最大值).无向图G的最小定向强直径sdiam(G)(相应的最大定向强直径SDIAM(G))定义为D中所有强定向的强直径的最小值(相应的最大值).本文确定了路和路的笛卡尔积的最小定向强半径srad(Pm×Pn)和强直径的值sdiam(Pm×Pn)

给出了最大定向强半径SRAD(Pm×Pn)的界并提出关于最大定向强直径SDIAM(Pm×Pn)的一个猜想.

Abstract

For two vertices u and v in a strong digraph D

the strong distance sd(u

v)between u and v is the minimum size(the number of arcs)of a strong sub-digraph of D containing u and v.For a vertex v of D

the strong eccentricity se(v)is the strong distance between v and a vertex farthest from v.The strong radius srad(D)(resp.strong diameter sdiam(D))is the minimum(resp.maximum)strong eccentricity among the vertices of D.The lower(resp.upper)orientable strong radius srad(G)(resp.SRAD(G))of a graph G is the minimum(resp.maximum)strong radius over all strong orientations of G.The lower(resp.upper) orientable strong diameter sdiam(G)(resp.SDIAM(G))of a graph G is the minimum(resp.maximum) strong diameter over all strong orientations of G.In this paper

we determine the lower orientable strong radius and strong diameter of Cartesian product of paths

and give bounds on the upper orientable strong radius and a conjecture of the upper orientable strong diameter of Cartesian product of paths.

关键词

Keywords

references

Bang-Jensen J,Gutin G.Digraphs:Theory,Algorithms and Applications[M].Springer,London,2000.

Chartrand G,Erwin D,Raines M,Zhang P.Strong Distance in Strong Digraphs[J].J Combin Math Combin Comput, 1999,31:33-44.

Chartrand G,Erwin D,Raines M,Zhang P.On Strong Distance in Strong Oriented Graphs[J].Congr Numer,1999,138: 49-63.

Peter Dankelmann,Henda C.Swart,David P.Day.On Strong Distance in Oriented Graphs[J].Discrete Math,2003,266: 195-201.

Lai Yungling,Chiang Fenghsu,Lin Chuhe,Yu Tungchin.Strong Distance of Complete Bipartite Graphs,The 19th Workshop on Combinatorial Mathematics and Computation Theory[M].2002,12-16.

Miao Huifang,Guo Xiaofeng.Lower and Upper Orientable Strong Radius and Strong Diameter of Complete k-Partite Graphs[J].Discrete Applied Mathematics,2006,154(11):1606-1614.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰