Results 131 to 140 of about 8,697 (224)
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
Discrete Mathematics, 2000 Let \(G\) denote a strongly-connected digraph with \(n\) nodes, girth \(g\), and diameter \(D\). The author shows that if \(G\) has \(t\) nodes of out-degree one, then \(D\leq n-g+ t\). He also shows that if \(r\) denotes the minimum out-degree of \(G\), then \(g\leq \max\{\lceil n/r\rceil, 2r- 2\}\). This last result implies that when \(n\geq 2r^2- 3r+
openaire +3 more sources
Circulant digraph isomorphisms [PDF]
, 2016 We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two ...
Cancela, Elias Damian, Cancela, Elias
core
Characterizations of Solutions in Digraph Competitions [PDF]
, 2002 The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on ...
Borm, P.E.M. +5 more
core +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 +3 more
openaire +1 more source
On the vertex-degree based invariants of digraphs [PDF]
Discrete Mathematics Letters, 2021 Hanyuan Deng +4 more
doaj +1 more source
, 2007 This document describes how to use DiGraph/Occam. It assumes that the user has read the documentation for the basic editor: DiGraph: Users Guide. Refer to this document to learn how to use the basic graph editor.
Ivan Porres, Iv#n Porres Paltor
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 +2 more
core
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