On the diameter of generalized Kneser graphs

Let r, k be positive integers, s(<r), a nonnegative integer, and n=2r-s+k. The set of r-subsets of [n]={1,2,…,n} is denoted by [n]^r. The generalized Kneser graph K(n,r,s) is the graph whose vertex-set is [n]^r where two r-subsets A and B are joined by an edge if |A∩B|?s. This note determines the diameter of generalized Kneser graphs. More precisely, the diameter of K(n,r,s) is equal to , which generalizes a result of Valencia-Pabon and Vera [On the diameter of Kneser graphs, Discrete Math. 305 (2005) 383-385].     

Bandwidth of the strong product of two connected graphs

The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)-f(y)|:xy∈E(G)} taken over all proper numberings f of G. The strong product of two graphs G and H, written as G(S_P)H, is the graph with vertex set V(G)×V(H) and with (u₁,v₁) adjacent to (u₂,v₂) if one of the following holds: (a) u₁ and v₁ are adjacent to u₂ and v₂ in G and H, respectively, (b) u₁ is adjacent to u₂ in G and v₁=v₂, or (c) u₁=u₂ and v₁ is adjacent to v₂ in H. In this paper, we investigate the bandwidth of the strong product of two connected graphs. Let G be a connected graph. We denote the diameter of G by D(G). Let d be a positive integer and let x,y be two vertices of G. Let denote the set of vertices v so that the distance between x and v in G is at most d. We define δ_d(G) as the minimum value of over all vertices x of G. Let denote the set of vertices z such that the distance between x and z in G is at most d-1 and z is adjacent to y. We denote the larger of and by . We define η(G)=1 if G is complete and η(G) as the minimum of over all pair of vertices x,y of G otherwise. Let G and H be two connected graphs. Among other results, we prove that if δ_D(H)(G)?B(G)D(H)+1 and B(H)=⌈(|V(H)|+η(H)-2)/D(H)⌉, then B(G(S_P)H)=B(G)|V(H)|+B(H). Moreover, we show that this result determines the bandwidth of the strong product of some classes of graphs. Furthermore, we study the bandwidth of the strong product of power of paths with complete bipartite graphs.     

Average Width and Optimal Recovery of Some Anisotropic Classes of Smooth Functions Defined on the Euclidean Space R~d

§ 1.Introduction and Main Results　 In[1 ] ,[2 ] ,the authors studied some problems of optimal recovery of functions de-fined on a cube,for a class of functions with partial derivatives of a fixed order havingmoduli of continuity not exceeding a given modules of continuity,and for the unit ballsSHαp in the spaces Hαp satisfying the mixed Holder conditionα,respectively.They ob-tained some weak asymptotic results.　 In[3 ] ,[4 ] and[5] ,Magarill-Il' yaev,Liu and Sun studied some proble…     

Diameter vulnerability of graphs by edge deletion

Let f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-connected graph with diameter k. This paper shows for t≥4, which corrects an improper result in [C. Peyrat, Diameter vulnerability of graphs, Discrete Appl. Math. 9 (3) (1984) 245-250] and also determines f(2,k)=3k−1 and f(3,k)=4k−2 for k≥3.     

Diameter preserving bijections between Grassmann spaces over Bezout domains

Let R, S be Bezout domains. Assume that n is an integer ≥ 3, 1 ≤ k ≤ n − 2. Denoted by the k-dimensional Grassmann space on . Let be a map. This paper proves the following are equivalent: (i) is an adjacency preserving bijection in both directions. (ii) is a diameter preserving bijection in both directions. Moreover, Chow’s theorem on Grassmann spaces over division rings is extended to the case of Bezout domains: If is an adjacency preserving bijection in both directions, then is induced by either a collineation or the duality of a collineation. Project 10671026 supported by National Natural Science Foundation of China.     

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs

The bounded edge-connectivity λ_k(G) of a connected graph G with respect to is the minimum number of edges in G whose deletion from G results in a subgraph with diameter larger than k and the edge-persistence D⁺(G) is defined as λ_d(G)(G), where d(G) is the diameter of G. This paper considers the Cartesian product G₁×G₂, shows λ_k1+k2(G₁×G₂)≥λ_k1(G₁)+λ_k2(G₂) for k₁≥2 and k₂≥2, and determines the exact values of D⁺(G) for G=C_n×P_m, C_n×C_m, Q_n×P_m and Q_n×C_m.     

Properties of connected graphs having minimum degree distance

The degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has been studied in mathematical chemistry. In this paper some properties of graphs having minimum degree distance in the class of connected graphs of order n and size m≥n−1 are deduced. It is shown that any such graph G has no induced subgraph isomorphic to P₄, contains a vertex z of degree n−1 such that G−z has at most one connected component C such that |C|≥2 and C has properties similar to those of G.For any fixed k such that k=0,1 or k≥3, if m=n+k and n≥k+3 then the extremal graph is unique and it is isomorphic to K₁+(K_1,k+1∪(n−k−3)K₁).     

基于消息的加权负载均衡算法

在研究EAP协议与Diameter协议的基础上,为解决分布式认证系统节点间会话一致性的问题,以及尽可能减少服务节点数量改变时产生的会话迁移数量,提出了一种基于消息的加权负载均衡算法(MOLB)。该算法使用散列法、虚拟节点和红黑树相结合的技术,实现了客户端请求在服务节点间的合理分布。Diameter网络环境中的实验结果表明:与其他常用的负载均衡算法相比,本文算法具有较小的负载均衡度和会话破坏度以及较低的会话破坏分布度。     

离子型钴铁氧体磁流体的稀土改性与机理研究

Rare earth composite cobalt ferrite ionic magnetic fluids were prepared by precipitation in the presence of Tri-sodium citrate. The sample phase, structure and particle sizes were determined by X-ray diffraction transmission and electron microscopy. It is clear that the particles appear as variously sized balls, Cobalt ferrite with sizes of 12-15 nm, Dysprosium cobalt ferrite and Yttrium cobalt ferrite with sizes of 6-8 nm. By adding rare earth ions, the average diameter of the magnetic nanoparticles was decreased. The decrease in diameter was explained using a micro-model of rare earth modification. The effect of rare earth ion modification on the saturation magnetization and magnetic induction of magnetic fluids was carried out using a Gouy magnetic balance and a spectrophotometer. The result shows that saturation magnetization and magnetic induction can be improved by adding Dy3+. By adding Y3+, magnetic induction was increased. However, the saturation magnetization then decreased. A theory of the mechanism of rare earth ion modification is discussed in detail.