1,316 research outputs found

    On (4,2)-digraph Containing a Cycle of Length 2

    Get PDF
    A diregular digraph is a digraph with the in-degree and out-degree of all vertices is constant. The Moore bound for a diregular digraph of degree d and diameter k is M_{d,k}=l+d+d^2+...+d^k. It is well known that diregular digraphs of order M_{d,k}, degree d>l tnd diameter k>l do not exist . A (d,k) -digraph is a diregular digraph of degree d>1, diameter k>1, and number of vertices one less than the Moore bound. For degrees d=2 and 3,it has been shown that for diameter k >= 3 there are no such (d,k)-digraphs. However for diameter 2, it is known that (d,2)-digraphs do exist for any degree d. The line digraph of K_{d+1} is one example of such (42)-digraphs. Furthermore, the recent study showed that there are three non-isomorphic(2,2)-digraphs and exactly one non-isomorphic (3,2)-digraph. In this paper, we shall study (4,2)-digraphs. We show that if (4,2)-digraph G contains a cycle of length 2 then G must be the line digraph of a complete digraph K_5

    The diameter of random Cayley digraphs of given degree

    Full text link
    We consider random Cayley digraphs of order nn with uniformly distributed generating set of size kk. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as nn\to\infty and k=f(n)k=f(n). We find a sharp phase transition from 0 to 1 at around k=nlognk = \sqrt{n \log n}. In particular, if f(n)f(n) is asymptotically linear in nn, the probability converges exponentially fast to 1.Comment: 11 page

    Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism

    Get PDF

    An overview of the degree/diameter problem for directed, undirected and mixed graphs

    Get PDF
    A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is to determine the largest (in terms of the number of vertices) graphs or digraphs or mixed graphs of given maximum degree, respectively, maximum outdegree, respectively, mixed degree; and given diameter. General upper bounds, called Moore bounds, exist for the largest possible order of such graphs, digraphs and mixed graphs of given maximum degree d (respectively, maximum out-degree d, respectively, maximum mixed degree) and diameter k. In recent years, there have been many interesting new results in all these three versions of the problem, resulting in improvements in both the lower bounds and the upper bounds on the largest possible number of vertices. However, quite a number of questions regarding the degree/diameter problem are still wide open. In this paper we present an overview of the current state of the degree/diameter problem, for undirected, directed and mixed graphs, and we outline several related open problems.Peer Reviewe

    Multipartite Moore digraphs

    Get PDF
    We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ\delta of vertices in each of the other independent sets. We determine when a Moore multipartite digraph is weakly distance-regular. Within this framework, some necessary conditions for the existence of a Moore rr-partite digraph with interpartite outdegree δ>1\delta>1 and diameter k=2mk=2m are obtained. In the case δ=1\delta=1, which corresponds to almost Moore digraphs, a necessary condition in terms of the permutation cycle structure is derived. Additionally, we present some constructions of dense multipartite digraphs of diameter two that are vertex-transitive
    corecore