141 research outputs found
On (4,2)-digraph Containing a Cycle of Length 2
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
Degree/diameter problem for mixed graphs
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs
Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
An almost Moore (d,k)-digraph is a regular digraph of degree d>1, diameter k>1 and order N(d,k)=d+d2+⋯+dk. So far, their existence has only been shown for k=2, whilst it is known that there are no such digraphs for k=3, 4 and for d=2, 3 when k≥3. Furthermore, under certain assumptions, the nonexistence for the remaining cases has also been shown. In this paper, we prove that (4,k) and (5,k)-almost Moore digraphs with self-repeats do not exist for k≥5.Nacho López: Supported in part by grants PID2020-115442RB-I00 and 2021 SGR-00434.
Arnau Messegué: Supported in part by grants Margarita Sala and 2021SGR-00434.
Josep M. Miret: Supported in part by grants PID2021-124613OB-I00 and 2021 SGR-00434.Peer ReviewedPostprint (published version
Enumerating Hamiltonian Cycles in A 2-connected Regular Graph Using Planar Cycle Bases
Planar fundamental cycle basis belong to a 2-connected simple graph is used for
enumerating Hamiltonian cycles contained in the graph. This is because a fun-
damental cycle basis is easily constructed. Planar basis is chosen since it has a
weighted induced graph whose values are limited to 1. Hence making it is possible
to be used in the Hamiltonian cycle enumeration procedures efficiently. In this
paper a Hamiltonian cycle enumeration scheme is obtained through two stages.
Firstly, i cycles out of m bases cycles are determined using an appropriate con-
structed constraint. Secondly, to search all Hamiltonian cycles which are formed
by the combination of i basis cycles obtained in the first stage efficiently. This ef-
ficiency is achieved through the generation of a class of objects consisting of Ill-bit
binary strings which is a representation of i cycle combinations between m cycle
basis cycle
The diameter of random Cayley digraphs of given degree
We consider random Cayley digraphs of order with uniformly distributed
generating set of size . Specifically, we are interested in the asymptotics
of the probability such a Cayley digraph has diameter two as and
. We find a sharp phase transition from 0 to 1 at around . In particular, if is asymptotically linear in , the
probability converges exponentially fast to 1.Comment: 11 page
An overview of the degree/diameter problem for directed, undirected and mixed graphs
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
- …