一类新的直径为4的整树

本文给出了ｒ为偶数，直径为４的树Ｓ（ｒ，ｍｉ）为整树的一个充分条件。由此得到了ｒ为偶数直径为４的整树Ｓ（ｒ，ｍｉ）的一些新类，给出了它们的谱。同时表明这类整树有无穷多个。从而解决了文［４］中提出的有关直径为４整树的一个问题     

Diameter preserving surjections in the geometry of matrices

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping φ:Γ→Γ^′ between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of Γ are at a distance equal to the diameter of Γ if, and only if, their images are at a distance equal to the diameter of Γ^′. This result is then applied to the graphs arising from the adjacency relations of spaces of rectangular matrices, spaces of Hermitian matrices, and Grassmann spaces (projective spaces of rectangular matrices).     

Harnack inequalities for graphs with non-negative Ricci curvature

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.     

The non-approximability of bicriteria network design problems

Let G be an undirected graph with two edge costs (c-cost and d-cost). We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. We prove that this problem is non-approximable, even in some special cases. Similar results are proved if the stretch factor or the root stretch factor is considered instead of the diameter.     

Measurement of diameter of metal cylinders using a sinusoidally vibrating interference pattern

A method for measuring external diameters of metal cylinders is proposed in which a sinusoidally vibrating interference pattern (SVIP) of 100-μm period is used as an exact scale. Lights from the end-points of a metal cylinder are extracted with a spatial filtering in an imaging system to form a cross-sectional image of the metal cylinder. On the image a sinusoidally phase-modulated signal owing to the SVIP is detected with a CCD image sensor to measure the phases of the SVIP at the two end-points of the cylinder. The coordinates of the two end-points are obtained from the phases at the two end-points, the phase distribution of the SVIP, and the coordinates of the pixels of the CCD image sensor. Metal cylinder diameters of 7.99, 8.00, and 9.00 mm are measured along their length directions with an error less than 1 μm.     

The small octagon with longest perimeter

The convex octagon with unit diameter and maximum perimeter is determined. This answers an open question dating from 1922. The proof uses geometric reasoning and an interval arithmetic based global optimization algorithm to solve a series of non-linear and non-convex programs involving trigonometric functions.     

几类特殊测地块的构造(英)

本文给出了一种构造给定直径d和围长g的测地块的方法．它是文［1］中构造法的推广，解决了文［1］中待研究的几个问题．同时，对文［1］中的一个错误进行了修正．     

Diameter of a direct power of a finite group

We present two conjectures concerning the diameter of a direct power of a finite group. The first conjecture states that the diameter of Gⁿ with respect to each generating set is at most n(|G|?rank(G)); and the second one states that there exists a generating set 𝒜, of minimum size, for Gⁿ such that the diameter of Gⁿ with respect to 𝒜 is at most n(|G|?rank(G)). We will establish evidence for each of the above mentioned conjectures.     

On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v_i and v_j in V(G) of G, recall that G+v_iv_j is the supergraph formed from G by adding an edge between vertices v_i and v_j. Denote the Harary index of G and G+v_iv_j by H(G) and H(G+v_iv_j), respectively. We obtain lower and upper bounds on H(G+v_iv_j)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.     

On the existence of hyper-L triple-loop networks

Aguiló-Gost [New dense families of triple loop Networks, Discrete Math. 197/198 (1999) 15-27] has presented a new type of hyper-L tiles and used it to derive a new dense family of triple-loop networks. While Aguiló-Gost's hyper-L tile seems to be a promising tool for studying the triple-loop networks, we need to verify that the hyper-L tile producing good result is indeed the MDD of some triple-loop network. In this paper, we give necessary and sufficient conditions for the existence of Aguiló-Gost's hyper-L triple-loop networks and we correct some flaws in [F. Aguiló-Gost, New dense families of triple loop networks, Discrete Math. 197/198 (1999) 15-27].