A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length ≤ k from u to v. If the diameter of G is k, we say that G is strongly geodetic. Let N(d, k) be the smallest possible order for a k-geodetic digraph of minimum out-degree d, then N(d, k) ≥ 1 + d+ d2 + . . .+ dk = M(d, k), where M(d, k) is the Moore boun...

Let G be a complex reductive group. We study the problem of associating Dixmier algebras to nilpotent (co)adjoint orbits of G, or, more generally, to orbit data for G. If g = 0 + n + in is a triangular decomposition of g and 0 is a nilpotent orbit, we consider the irreducible components of 0 n n, which are Lagrangian subvarieties of 0. The main idea is to construct, starting with certain "good"...

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

Fine registration of point clouds plays an important role in data analysis in Terrestrial Laser Scanning (TLS). This work proposes a block-to-point fine registration approach to correct the errors of point clouds from TLS and of geodetic networks observed using total stations. Based on a reference coordinate system, the block-to-point estimation is performed to obtain representative points. The...

In this paper we learn the new idea of forcing total outer independent edge geodetic number a graph. Let G be connected graph and R minimum set G. A subset L ⊆ is known as for if unique containing L. cardinality R. The denoted by (G) = min , where taken over all in Some general properties satisfied concept are studied. It shown that any couple integers l, m with0 < l ≤ − 4, there exists such .

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring a sufficiently large complete K2n, there exists decomposition K2n into isomorphic spanning trees. This settles conjectures Brualdi–Hollingsworth (from 1996) and Constantine 2002) for graphs.