Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of G∖{1} is called minimal if 〈S〉=G and there exists some s∈S such that 〈S∖{s,s−1}〉≠G. In this paper, we characterize distance-regular Cayley graphs Cay(G,S) under the condition minimal.

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

Académie serbe des sciences et des arts-2004 Classe des sciences mathématiques et naturelles sciences mathématiques, N o 29 A b s t r a c t. The generalized inverse L † of the Laplacian matrix of a connected graph is examined and some of its properties are established. In some physical and chemical considerations the quantity r ij = (L †) ii + (L †) jj − (L †) ij − (L †) ji is encountered; it i...

The aim of this paper is to establish random coincidence point results for weakly increasing random operators in the setting of ordered metric spaces by using generalized altering distance functions. Our results present random versions and extensions of some well-known results in the current literature.

Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships between cells (vertices, edges, faces, volumes, ...). In this paper, we introduce distance measures for comparing generalized maps, which is an important issue for image processing and analysis. We introduce a first distance measure which is defined by means of...

The purpose of the present paper is to investigate the structure of distance spheres and cut locus C(K) to a compact set K of a complete Alexandrov surface X with curvature bounded below. The structure of distance spheres around K is almost the same as that of the smooth case. However C(K) carries different structure from the smooth case. As is seen in examples of Alexandrov surfaces, it is pro...

We classify triangleand pentagon-free distance-regular graphs with diameter d ≥ 2, valency k, and an eigenvalue multiplicity k. In particular, we prove that such a graph is isomorphic to a cycle, a k-cube, a complete bipartite graph minus a matching, a Hadamard graph, a distance-regular graph with intersection array {k, k − 1, k − c, c, 1; 1, c, k − c, k − 1, k}, where k = γ(γ + 3γ + 1), c = γ(...

We study large–distance contributions to the nucleon parton densities in the transverse coordinate (impact parameter) representation based on generalized parton distributions (GPDs). Chiral dynamics generates a distinct component of the partonic structure, located at momentum fractions x . Mπ/MN and transverse distances b ∼ 1/Mπ . We analyze the phenomenological “pion cloud” model of the flavor...

EP e;Ed (C; Co) Pe(C) + exp f0NEr(Ro)g: Then, the second and third assertion follow since there must exist a Co which satisfies y y y x x x2C [y y y 6 2 S(x x