共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
Huiqiu Lin 《Linear and Multilinear Algebra》2013,61(4):442-447
Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ?(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible. 相似文献
3.
4.
5.
P. Frosini 《Applied Mathematics Letters》2002,15(8):931-935
Consider the set K of all nonempty compact subsets of a compact metric space (M, d), endowed with the Hausdorff metric. In this paper, we prove that K is isometric to a subset of l∞(
). An approximation result is also proved. 相似文献
6.
Kei Funano 《Proceedings of the American Mathematical Society》2008,136(8):2911-2920
In 1999, M. Gromov introduced the box distance function on the space of all mm-spaces. In this paper, by using the method of T. H. Colding, we estimate and , where is the -dimensional unit sphere in and is the -dimensional complex projective space equipped with the Fubini-Study metric. In particular, we give the complete answer to an exercise of Gromov's green book. We also estimate from below, where is the special orthogonal group.
7.
Luo-fei LIU College of Mathematics Computer Science Jishou University Jishou China 《中国科学A辑(英文版)》2007,50(3):345-350
We give an example which shows that the Burago's bounded distance theorem does not hold in a non-intrinsic metric case. The argument is based on the classical answer to the densest circle packing problem in R2. 相似文献
8.
二元码的平均Hamming距离和方差 总被引:3,自引:0,他引:3
通过对二元n长码C的对偶距离分布的研究,在码字数为奇数的情况下,改进了Al-thofer-Sillke[1]和[2]文关于C的码字间平均Hamming距离及其均方差的不等式,并在码字数为2n-1或2n-1-1时,确定了码C的最小平均距离及其均方差的精确值. 相似文献
9.
A graph G is degree-continuous if the degrees of every two adjacent vertices of G differ by at most 1. A finite nonempty set S of integers is convex if k S for every integer k with min(S)kmax(S). It is shown that for all integers r > 0 and s 0 and a convex set S with min(S) = r and max(S) = r+s, there exists a connected degree-continuous graph G with the degree set S and diameter 2s+2. The minimum order of a degree-continuous graph with a prescribed degree set is studied. Furthermore, it is shown that for every graph G and convex set S of positive integers containing the integer 2, there exists a connected degree-continuous graph H with the degree set S and containing G as an induced subgraph if and only if max(S)(G) and G contains no r-regular component where r = max(S). 相似文献
10.
This is the second part of the series of papers devoted to the determination of the minimum distance of two-point codes on
a Hermitian curve. We study the case where the minimum distance agrees with the designed one. In order to construct a function
which gives a codeword with the designed minimum distance, we use functions arising from conics in the projective plane.
AMS Classification: 94B27, 14H50, 11T71, 11G20 相似文献
11.
In this paper we consider the incremental/decremental version of the edit distance problem: given a solution to the edit distance between two strings A and B, find a solution to the edit distance between A and B′ where B′=aB (incremental) or bB′=B (decremental). As a solution for the edit distance between A and B, we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem. 相似文献
12.
This paper deals with the deviation distance to visit a facility from pre-planned routes. Facilities are approximated by both points and lines on a continuous plane. To see the relationship between the deviation distance and the availability of facilities, we derive the distributions of the rectilinear deviation distance for regular and random patterns of facilities. These distributions demonstrate how the shortest distance and the relative position of origin and destination affect the deviation distance. We also show that the deviation distance is a generalization of the nearest neighbour distance. 相似文献
13.
Precise behaviour of the Carathéodory, Kobayashi and Bergman metrics and distances near smooth boundary points of planar domains is found under various assumptions of regularity. 相似文献
14.
15.
本文研究了几类图的距离模式识别性.利用构造法,求出了它们的距离模式识别集和距离模式识别数,提出距离模式识别率的概念,推广了距离模式识别数的概念. 相似文献
16.
In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic.
In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes
whose minimum distances agree with the designed ones. 相似文献
17.
摘要给出了一种Chebyshev距离下的常重复合码的构造,并在其基础上讨论了它的译码算法和优化处理.考虑了Chebyshev距离下的界及其改进.研究了具有Chebyshev距离和Hamming距离的常重复合码的构造,给出了Hamming距离为4的常重复合码的一个结论. 相似文献
18.
19.
20.
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietäväinen lt:newu and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The upper bound on the information rate is an application of a shortening method of a code and is an analogue of the Shannon-Gallager-Berlekamp straight line bound on error probability. These results improve on the best presently known asymptotic upper bounds on minimum distance and covering radius of non-binary codes in certain intervals. 相似文献