Results 91 to 100 of about 9,039,686 (137)

On the automorphism groups of edge-coloured digraphs

Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1989
For any finite group G={g 1 ,g 2 ,…,g q }, we construct an edge-coloured strongly connected digraph Δ=Δ(G) with the vertex-set VΔ={g 1 ,g 2 ,…,g q } such that for any two vertices u and v of Δ both (u,v) and (v,u) are directed edges of Δ and they are coloured with colours u −1 v and v −1 u respectively.
openaire   +2 more sources

When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph

Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph.
Fiol Mora, Maria Lluïsa, Fiol Mora, Miquel Àngel, Andrés Yebra, José Luis   +2 more
core  

Digraphs from Endomorphisms of Finite Cyclic Groups

, 2010
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
openaire   +3 more sources

DiGraph: Users Guide

, 2008
This document describes DiGraph version 0.9. When DiGraph starts it shows its version number. If the number shown is different from the version of this document, then this document is out of date. This document is divided in three main chapters.
Ivan Porres
core  

On the Beta measure for digraph competitions. [PDF]

Borm, P.E.M., Voorneveld, M., Quant, M., Reijnierse, J.H.   +3 more
core  

Line digraph iterations and the (d,k) digraph problem

This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of vertices ...
Fiol Mora, Miquel Àngel, Alegre de Miguel, Ignacio, Andrés Yebra, José Luis   +2 more
core  

Multiset Dimension of Cayley Digraphs of Abelian Groups

Journal of Information Processing
Cueno, Anthony L., Garciano, Agnes D., Marcelo, Reginaldo M.   +2 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Two‐sided Group Digraphs and Graphs

Journal of Graph Theory, 2015
AbstractWe study a family of digraphs (directed graphs) that generalises the class of Cayley digraphs. For nonempty subsets of a group G, we define the two‐sided group digraph to have vertex set G, and an arc from x to y if and only if for some and . In common with Cayley graphs and digraphs, two‐sided group digraphs may be useful to model networks
Moharram N. Iradmusa, Cheryl E. Praeger
openaire   +1 more source

On Cayley digraphs on nonisomorphic 2‐groups

Journal of Graph Theory, 2011
AbstractA necessary and sufficient condition is given for two Cayley digraphs X1 = Cay(G1, S1) and X2 = Cay(G2, S2) to be isomorphic, where the groups Gi are nonisomorphic abelian 2‐groups, and the digraphs Xi have a regular cyclic group of automorphisms. Our result extends that of Morris [J Graph Theory 3 (1999), 345–362] concerning p‐groups Gi, where
István Kovács, Mary Servatius
openaire   +1 more source

AUTOMORPHISM GROUPS OF BICOSET DIGRAPHS

Bulletin of the Australian Mathematical Society
AbstractWe examine bicoset digraphs and their natural properties from the point of view of symmetry. We then consider connected bicoset digraphs that are X-joins with collections of empty graphs, and show that their automorphism groups can be obtained from their natural irreducible quotients.
RACHEL BARBER, TED DOBSON, GREGORY ROBSON   +2 more
openaire   +1 more source