Results 21 to 30 of about 28,427 (196)
AKCE International Journal of Graphs and Combinatorics, 2020 Let and be two digraphs; without loops or multiple arcs. An coloring of is a function . We say that is an colored digraph. For an arc of , we say that is the color of over the coloring . A directed path in is an path if is a directed walk in .
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Journal of Research of the National Institute of Standards and Technology, 2014 A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. One of the characterizations is new, and allows for a shorter proof of the equivalence of the two known ...
Cloteaux, Brian +3 more
openaire +3 more sources
Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
Discussiones Mathematicae Graph Theory, 2021 A (1, ≤ ℓ)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph
Balbuena Camino +2 more
doaj +1 more source
Disimplicial arcs, transitive vertices, and disimplicial eliminations [PDF]
, 2014 In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence.
Eguía, Martiniano +1 more
core +3 more sources
From Subkautz Digraphs to Cyclic Kautz Digraphs [PDF]
Journal of Interconnection Networks, 2018 The Kautz digraphs K(d, ℓ) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to these, the cyclic Kautz digraphs CK(d, ℓ) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed.
openaire +5 more sources
Double vertex digraphs of digraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Yubin, Shao, Yanling
openaire +1 more source
Kernels by Monochromatic Paths and Color-Perfect Digraphs
Discussiones Mathematicae Graph Theory, 2016 For a digraph D, V (D) and A(D) will denote the sets of vertices and arcs of D respectively. In an arc-colored digraph, a subset K of V(D) is said to be kernel by monochromatic paths (mp-kernel) if (1) for any two different vertices x, y in N there is no
Galeana-Śanchez Hortensia +1 more
doaj +1 more source
Operations Research and Decisions, 2016 OPERATIONS RESEARCH AND DECISIONS; ISSN 2081 ...
Peters, Hans +2 more
openaire +8 more sources
International Journal of Mathematics and Mathematical Sciences, 1993 The antipodal graph of a graph G, denoted by A(G), has the same vertex set as G with an edge joining vertices u and v if d(u,v) is equal to the diameter of G.
Garry Johns, Karen Sleno
doaj +1 more source