Characterization of eccentric digraphs
The eccentric digraphED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being 'eccentric'; that is, there is an arc from u to v in ED(G) if and only if v is at maximum distance from u in G. A digraph G is said to be eccentric if there exists a digraph H such that G=ED(H). This paper is devoted to the study of the following two questions: what digraphs are eccentric and when the relation of being eccentric is symmetric. We present a characterization of eccentric digraphs, which in the undirected case says that a graph G is eccentric iff its complement graph G@? is either self-centered of radius two or it is the union of complete graphs. As a consequence, we obtain that all trees except those with diameter 3 are eccentric digraphs. We also determine when ED(G) is symmetric in the cases when G is a graph or a digraph that is not strongly connected.

title: Minimum Diameter of Diregular Digraphs of Degree 2
abstract: Etude de certaines relations entre le nombre de sommets, degre et diametre de graphes finis diregulaires. Les trois problemes consideres sont N(d,k), K(u,d) et D(u, k) ou, autrement dit, trouver le nombre maximum possible de sommets etant donnes le degre d et le diametre k; trouver le diametre minimum possible etant donnes le nombre de sommets n et le degre d et trouver le degre minimum possible etant donnes le nombre de sommets n et le diametre k respectivement

title: Connected graphs which are not mod sum graphs
abstract: In this paper we prove that no wheel with the exception of W 4 can be a mod sum graph. We also give the unique (up to multiplication by positive integers) mod sum labelling of W 4 . We also prove that the symmetric complete bipartite graph K n . n is not a mod sum graph.

title: Vertex-Magic Total Labelings Of Generalized Petersen Graphs
abstract: A vertex-magic total labeling of a graph G=(V, E) with v vertices and e edges is an assignment of the integers from 1 to v + e to the vertices and edges of G with the property that the sum of the label on a vertex and the labels on its incident edges is a constant, independent of the choice of the vertex. In this paper we give a vertex-magic total labeling for the generalized Petersen graphs P(n, m) for all n@3,1@m⌊(n−1)/2⌋.

title: Bounds on the number of isolates in sum graph labeling
abstract: A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with label L(w )= L(u )+ L(v). The sum number � (G) of a graph G =( V; E) is the least integer r such that the graph H consisting of G and r isolated vertices is a sum graph. It is clear that � (G)6|E|. In this paper, we discuss general upper and lower bounds on the sum number. In particular, we prove that, over all graphs G =( V; E) with 5xed |V |?3 and |E|, the average of � (G) is at least |E |− 3|V |(log|V |)=[log(( |V | 2 )=|E|)] −| V |− 1. In other words, for most graphs, � (G) ∈ (|E|).

title: Complete characterization of almost Moore digraphs of degree three
abstract: It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No 2004 Wiley Periodicals, Inc.

title: Consecutive magic graphs
abstract: Let G be a graph of order n and size e. A vertex-magic total labeling is an assignment of the integers 1,2,...,n+e to the vertices and the edges of G, so that at each vertex, the vertex label and the labels on the edges incident at that vertex, add to a fixed constant, called the magic number of G. Such a labeling is a-vertex consecutive magic if the set of the labels of the vertices is {a+1,a+2,...,a+n}, and is b-edge consecutive magic if the set of labels of the edges is {b+1,b+2,...,b+e}. In this paper we prove that if an a-vertex consecutive magic graph has isolated vertices then the order and the size satisfy (n-1)^2+n^2=(2e+1)^2. Moreover, we show that every tree with even order is not a-vertex consecutive magic and, if a tree of odd order is a-vertex consecutive then a=n-1. Furthermore, we show that every a-vertex consecutive magic graph has minimum degree at least two if a=0, or both 2e>=6n^2-2n+1 and 2a==10n^2-6n+1+4a and 2a=

title: Large deformation diffeomorphic metric mapping of vector fields
abstract: This paper proposes a method to match diffusion tensor magnetic resonance images (DT-MRIs) through the large deformation diffeomorphic metric mapping of vector fields, focusing on the fiber orientations, considered as unit vector fields on the image volume. We study a suitable action of diffeomorphisms on such vector fields, and provide an extension of the Large Deformation Diffeomorphic Metric Mapping framework to this type of dataset, resulting in optimizing for geodesics on the space of diffeomorphisms connecting two images. Existence of the minimizers under smoothness assumptions on the compared vector fields is proved, and coarse to fine hierarchical strategies are detailed, to reduce both ambiguities and computation load. This is illustrated by numerical experiments on DT-MRI heart images.

title: Dynamic Programming Generation of Curves on Brain Surfaces
abstract: Dynamic programming algorithms are presented for automated generation of length minimizing geodesics and curves of extremal curvature on the neocortex of the macaque and the visible human. Probabilistic models of curve variation are constructed in terms of the variability in speed, curvature, and torsion in the Frenet representation.

title: Two new families of large compound graphs
abstract: A question of special interest in graph theory is the design of large graphs. Specifically, we want to find constructions of graphs with order as large as possible for a given degree and diameter D . Two generalizations of two large compound graphs are proposed in this article. Three particular cases of these families of graphs presented here allow us to improve the order for the entries (15, 7), (13, 10), and (15, 10) in the table of the largest known ( , D)-graphs.

title: A stochastic model for studying the laminar structure of cortex from MRI
abstract: The human cerebral cortex is a laminar structure about 3 mm thick, and is easily visualized with current magnetic resonance (MR) technology. The thickness of the cortex varies locally by region, and is likely to be influenced by such factors as development, disease and aging. Thus, accurate measurements of local cortical thickness are likely to be of interest to other researchers. We develop a parametric stochastic model relating the laminar structure of local regions of the cerebral cortex to MR image data. Parameters of the model include local thickness, and statistics describing white, gray and cerebrospinal fluid (CSF) image intensity values as a function of the normal distance from the center of a voxel to a local coordinate system anchored at the gray/white matter interface. Our fundamental data object, the intensity-distance histogram (IDH), is a two-dimensional (2-D) generalization of the conventional 1-D image intensity histogram, which indexes voxels not only by their intensity value, but also by their normal distance to the gray/white interface. We model the IDH empirically as a marked Poisson process with marking process a Gaussian random field model of image intensity indexed against normal distance. In this paper, we relate the parameters of the IDH model to the local geometry of the cortex. A maximum-likelihood framework estimates the parameters of the model from the data. Here, we show estimates of these parameters for 10 volumes in the posterior cingulate, and 6 volumes in the anterior and posterior banks of the central sulcus. The accuracy of the estimates is quantified via Cramer-Rao bounds. We believe that this relatively crude model can be extended in a straightforward fashion to other biologically and theoretically interesting problems such as segmentation, surface area estimation, and estimating the thickness distribution in a variety of biologically relevant contexts.