Results 21 to 30 of about 1,092 (193)
Direct product of automorphism groups of digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Grech +3 more
openaire +3 more sources
Reachability relations, transitive digraphs and groups
In A. Malnic, D. Marusic, N. Seifter, P. Sparl and B. Zgrablic, Reachability relations in digraphs, Europ. J. Combin. 29 (2008), 1566–1581, it was shown that properties of digraphs such as growth, property Z , and number of ends are reflected by the properties of certain reachability relations defined on the vertices of the corresponding digraphs.
Aleksander Malnic +3 more
openaire +4 more sources
The automorphism group of the zero-divisor digraph of matrices over an antiring
We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero ...
Gabriel Verret +3 more
core +1 more source
Automorphism groups of Cayley digraphs of ${\Bbb Z}_p^3$ [PDF]
We calculate the full automorphism group of Cayley digraphs of ${\Bbb Z}_p^3$, $p$ an odd prime, as well as determine the $2$-closed subgroups of $S_m \wr S_p$ with the product action.
Dobson, Edward, Kovács, István
openaire +2 more sources
DIGRAPH GROUPS AND RELATED GROUPS [PDF]
This thesis investigates finite digraph groups and related groups like the generalization of Johnson and Mennicke groups. Cuno and Williams introduced the term "digraph group" for the first time in [9], 2020.
Cihan, Mehmet Sefa
core
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph [PDF]
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 +2 more
core +1 more source
Digraph Groups Without Leaf Having An Arc Count One Greater Than Their Vertex
This paper investigates a particular class of digraph groups that are defined by non-empty balanced presentations. Each relation is expressed in the form R(x,y), where x and y are distinct generators, and R(⋅,⋅) is based on a fixed cyclically reduced ...
Mehmet Sefa Cihan
doaj +1 more source
Abstract In the present paper the class of digraph groups is introduced by analogy with the prominent class of “graph groups”. Digraph groups implicitly present in the previous work by the author on the automorphism groups of graph groups. The structure of transitive digraph groups is described in terms of the Levi decomposition into the
openaire +1 more source
Isomorphisms of Cayley digraphs of Abelian groups [PDF]
For a finite group G and a subset S of G with 1 ∉ S, the Cayley graph Cay(G, S) is the digraph with vertex set G such that (x, y) is an arc if and only if yx−1 ∈ S. The Cayley graph Cay(G, S) is called a CI-graph if, for any T ⊂ G, whenever Cay (G, S) ≅ Cay(G, T) there is an element a σ ∈ Aut(G) such that Sσ = T.
openaire +2 more sources
An iterative procedure for evaluating digraph competitions [PDF]
A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph. Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ...
Borm, P.E.M. +5 more
core +1 more source

