Results 131 to 140 of about 6,654 (223)

On arc-coloring of digraphs [PDF]

Opuscula Mathematica, 2006
In the paper we deal with the problem of the arc-colouring of some classes of digraphs (tournaments, complete digraphs and products of digraphs).
Małgorzata Zwonek
doaj  

Finite-dimensional flexible algebras associated with directed and weighted CW complexes

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj   +1 more source

CAYLEY COLOR DIGRAPH DARI GRUP SIKLIK DENGAN n BILANGAN PRIMA [PDF]

, 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   +1 more source

MAKSIMUM TINGKAT DIGRAPH BERDIAMETER 2 ATAU BERDERAJAT 2 [PDF]

, 2002
Suatu Digraph G disebut digraph diregular derajat d jika mempunyai derajat masuk = derajar keluar d untuk setiap titik.
UMI LESTARI, 089611490
core  

On the vertex-degree based invariants of digraphs [PDF]

Discrete Mathematics Letters, 2021
Hanyuan Deng, Zikai Tang, Jiaxiang Yang, Jing Yang, Meiling You   +4 more
doaj   +1 more source

On quotient digraphs and voltage digraphs

, 2016
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line digraphs, which are two known approaches to obtain dense digraphs.
Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel, Miller, Mirka, Ryan, Joe   +3 more
openaire   +1 more source

Line digraph iterations and diameter vulnerability [PDF]

, 1999
. Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability based on the line digraph iteration which improves and generalizes several existing results in ...
Dongsoo Kim, Ting Yu, Feng Cao, Shitou Han, Ding-zhu Du   +4 more
core  

Cordial Digraphs

Journal of Combinatorial Mathematics and Combinatorial Computing
A ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph.
openaire   +2 more sources

On quotient digraphs and voltage digraphs

, 2017
Research of the first two authors is supported by MINECO under project MTM2014-60127-P, and by AGAUR under project 2014SGR1147. The first author has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 734922.
Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel, Miller, Mirka, Ryan, Joe   +3 more
openaire   +2 more sources

Spaces and sequences in the hippocampus: a homological perspective. [PDF]

J Comput Neurosci
Babichev A, Vashin V, Dabaghian Y.
europepmc   +1 more source