Results 91 to 100 of about 1,092 (193)
A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order
, 2000 Let Zn be a cyclic group of order n and C(Zn, S) the circulant digraph of Zn with respect to S⊆Zn\{o}. S is called a DCI-subset of Zn if, for any circulant digraph C(Zn, T), C(Zn, S)≅C(Zn, T) implies that S and T are conjugate in Aut(Zn), the ...
Meng, Jixiang, Huang, Qiongxiang
core +1 more source
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 +2 more
core
Digraph Algebras over Discrete Pre-ordered Groups [PDF]
, 2013 This thesis consists of studies in the separate fields of operator algebras and non-associative algebras. Two natural operator algebra structures, A ⊗_max B and A ⊗_min B, exist on the tensor product of two given unital operator algebras A and B. Because
Chan, Kai-Cheong
core
Group inverses of matrices with path graphs
, 2008 A simple formula for the group inverse of a 2 × 2 block matrix with a bipartite digraph is given in terms of the block matrices. This formula is used to give a graph-theoretic description of the group inverse of an irreducible tridiagonal matrix of odd ...
Catral, Minerva +3 more
core +1 more source
, 1995 Given a colouring Δ of a d-regular digraph G and a colouring Π of the symmetric complete digraph on d vertices with loops, the uniformly induced colouring LΠΔ of the line digraph LG is defined.
Serra, O. +3 more
core +1 more source
Digraphs Admitting Sharply Edge-transitive Automorphism Groups
European Journal of Combinatorics, 1987 A permutation group G on a set X is a sharply edge-transitive group (SETG) if there exists a directed graph (X,R) such that \(G\leq Aut(X,R)\) and G acts as a regular permutation group on R. Let \(K^ h_ m\) denote the directed graph whose vertex set is partitioned into h disjoint m-sets and any two vertices in distinct m-sets are joined in both ...
openaire +2 more sources
Infinite highly arc transitive digraphs and universal covering digraphs
, 1993 A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group is transitive on the set of s-arcs for each s≥0. Several new constructions are given of infinite highly arc transitive digraphs.
Praeger, Cheryl E. +2 more
core +1 more source
Open access article. Creative Commons Attribution 4.0 International license (CC BY 4.0) appliesA Cayley graph Cay(G, S) has the CI (Cayley Isomorphism) property if for every isomorphic graph Cay(G, T), there is a group automorphism α of G such that Sα =
Morris, Joy
core +1 more source
Games with a Local Permission Structure: Separation of Authority and Value Generation
, 2014 It is known that peer group games are a special class of games with a permission structure. However, peer group games are also a special class of (weighted) digraph games.
van den Brink, J.R.; id_orcid +2 more
core +1 more source
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