In this work, we determine a bound of the lower orientable strong diameters and the bounds of the upper orientable strong diameters for graphs G = ( V , E )�...
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�...
... lower orientable strong diameters and the bounds on the upper orientable strong diameters for graphs G = (V,E) satisfying the Ore condition (that is, σ2(G)�...
In this work, we determine a bound of the lower orientable strong diameters and the bounds of the upper orientable strong diameters for graphs G = ( V , E )�...
In this paper, we determine the lower orientable strong radius and strong diameter of the Cartesian product of complete graphs, and give the upper orientable�...
No information is available for this page. � Learn why
Lower and upper orientable strong diameters of graphs satisfying the Ore condition. Authors. Meirun Chen � Xiaofeng Guo � Hao Li. Source Information. July 2009�...
All graphs considered in this paper are connected simple graphs. We denote the vertex set and the edge set of a graph by ( ) and ( ), respectively. For two.
Lower and upper orientable strong diameters of graphs satisfying the Ore condition � Meirun ChenXiaofeng GuoHao Li. Mathematics. Appl. Math. Lett. 2009. 1�...
Lower and upper orientable strong diameters of graphs satisfying the Ore condition. Chen M., Guo X., Li H. Q1. Elsevier. Applied Mathematics Letters , 2009�...