The last subconstituent of the Hemmeter graph

We prove that when q is any odd prime power, the distance-2 graph on the set of vertices at maximal distance D from any fixed vertex of the Hemmeter graph Hem_D(q) is isomorphic to the graph Quad_D-1(q) of quadratic forms on .     

MATLAB在空间图形中的动态应用

学生空间思维的不足影响了学生对空间曲面的理解和重积分的学习。本文通过二个实例,重点讨论了用MATLAB动态生成空间图形的技巧。     

On measure‐valued solutions to a two‐dimensional gravity‐driven avalanche flow model

This paper concerns measure‐valued solutions for the two‐dimensional granular avalanche flow model introduced by Savage and Hutter. The system is similar to the isentropic compressible Euler equations, except for a Coulomb–Mohr friction law in the source term. We will partially follow the study of measure‐valued solutions given by DiPerna and Majda. However, due to the multi‐valued nature of the friction law, new more sensitive measures must be introduced. The main idea is to consider the class of x‐dependent maximal monotone graphs of non‐single‐valued operators and their relation with 1‐Lipschitz, Carathéodory functions. This relation allows to introduce generalized Young measures for x‐dependent maximal monotone graph. Copyright © 2005 John Wiley & Sons, Ltd.     

A note on optimality conditions for the Euclidean. Multifacility location problem

Thekey problem of the Euclidean multifacility location (EMFL) problem is to decide whether a givendead point is optimal. If it is not optimal, we wish to compute a descent direction. This paper extends the optimality conditions of Calamai and Conn and Overton to the case when the rows of the active constraints matrix are linearly dependent. We show that linear dependence occurs wheneverG, the graph of the coinciding facilities, has a cycle. In this case the key problem is formulated as a linear least squares problem with bounds on the Euclidean norms of certain subvectors.     

A conjecture of Borodin and a coloring of Grünbaum

In 1976, Borodin conjectured that every planar graph has a 5‐coloring such that the union of every k color classes with 1 ≤ k ≤ 4 induces a (k—1)‐degenerate graph. We prove the existence of such a coloring using 18 colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:139–147, 2008     

Weighted scattering matrices of regular coverings of graphs

We give a decomposition formula for the determinant det(I ? U(λ)) of the weighted bond scattering matrix U(λ) of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express some determinant of the weighted bond scattering matrix of a regular covering of G by means of its L-functions.     

Closed graph and open mapping theorems for normed cones

A quasi-normed cone is a pair (X, p) such that X is a (not necessarily cancellative) cone and q is a quasi-norm on X. The aim of this paper is to prove a closed graph and an open mapping type theorem for quasi-normed cones. This is done with the help of appropriate notions of completeness, continuity and openness that arise in a natural way from the setting of bitopological spaces.     

有向图n·■_m的优美性

给定有向图D(V,E),如果存在一个单射f:V(D)→{0,1,…,|E|}使得对于每条有向边(u,v),诱导函数f′:E(D)→{1,2,…,|E|}是一个双射函数,其中,f′(u,v)=[f(v)-f(u)](mod(|E|+1)),则f称为有向图D(V,E)的优美标号,f′称为有向图D(V,E)的诱导的边的优美标号.本文讨论了有向图n.■m的优美性,并且证明了当m=23且n为偶数时,n.■m是优美有向图.     

Constant memory routing in quasi-planar and quasi-polyhedral graphs

We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three-dimensional space. In two dimensions we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In the former case such graphs are geometrically embedded in R² and have an underlying backbone that is planar with convex faces; however within each face arbitrary edges (with arbitrary crossings) are allowed. In the latter case, these graphs are geometrically embedded in R³ and consist of a backbone of convex polyhedra and arbitrary edges within each polyhedron. In both cases we provide a routing algorithm that guarantees delivery. Our algorithms need only “remember” the source and destination nodes and one (respectively, two) reference nodes used to store information about the underlying face (respectively, polyhedron) currently being traversed. The existence of the backbone is used only in proofs of correctness of the routing algorithm; the particular choice is irrelevant and does not affect the behaviour of the algorithm.