Results 81 to 90 of about 1,092 (193)

Evenly partite star factorization of symmetric digraph of wreath product of graphs

open access: yes, 2017
For any graph , let be the symmetric digraph obtained from by replacing every edge with a pair of symmetric arcs. In this paper, we show that the necessary and sufficient condition for the existence of an -factorization in is , where is odd. In fact, our
A. Muthusamy, P. Hemalatha
core   +1 more source

The conjugacy problem for automorphism groups of homogeneous digraphs

open access: yesContributions to Discrete Mathematics, 2017
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous articles. In this article we complete the program, and establish a dichotomy theorem that this complexity is either ...
Samuel Coskey, Paul Ellis
openaire   +2 more sources

CAYLEY COLOR DIGRAPH DARI GRUP SIKLIK DENGAN n BILANGAN PRIMA

open access: yes, 2013
Abstrak Penelitian ini merupakan penelitian deskriptif-kualitatif dengan menggunakan metode penelitian kepustakaan (Library Research) yaitu penelitian yang mengkaji kepustakaan, khususnya tentang Cayley Color Digraf  dengan tujuan untuk mengumpulkan ...
Jalil, Abdul
core  

Measuring the power of nodes in digraphs [PDF]

open access: yes, 2001
Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature.
Herings, P.J.J.   +7 more
core   +1 more source

Path Hamilton pada Digraph Cayley

open access: yes, 2014
This paper is a descriptive-qualitative research methods literature (library research) research that examines the literature, especially on digraph Cayley for the purpose of collecting data and information with the help of a variety of materials such ...
Br Sembiring, Metrilitna
core  

The positional power of nodes in digraphs [PDF]

open access: yes, 2005
Many economic and social situations can be represented by a digraph. Both local and global methods to determine the strength or power of all the nodes in a digraph have been proposed in the literature.
Dolf Talman   +7 more
core   +1 more source

The digraph of the kth power mapping of the quotient ring of polynomials over finite fields

open access: yes, 2012
This work is based on ideas of Somer and Křížek on the digraphs associated with the congruence ak≡bmodn. We study the power digraph whose vertex set Vf is the quotient ring A/fA and edge set is given by Ef(k)={(g¯,g¯k):g¯∈A/fA}, where A=Fq[x], k>1 and f ...
Nathakhun Wiroonsri   +3 more
core   +1 more source

Demiarcs, creaons and genons [PDF]

open access: yes, 1981
Useful insights into the representation of natural systems can be gained by decomposing directed graphs (digraphs) into elementary components. Arcs of digraphs can be split into male demiarcs (outarcs) which leave vertices and female demiarcs (inarcs ...
Harary, Frank, Bosserman, Robert W.
core   +1 more source

Computing the degreewidth of a digraph is hard

open access: yes
Given a digraph, an ordering of its vertices defines a backedge graph, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order.
Oijid, Nacim   +4 more
core   +1 more source

Grothendieck group invariants for partly self-adjoint operator algebras.

open access: yes, 2000
Partially ordered Grothendieck group invariants are introduced for general operator algebras and used in the classification of direct systems and direct limits of finite-dimensional complex incidence algebras with common reduced digraph H (systems of H ...
Power, Stephen C., S. C. POWER
core   +1 more source

Home - About - Disclaimer - Privacy