Results 121 to 130 of about 34,455 (233)
Journal of Computer and System Sciences, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutin, Gregory +3 more
openaire +7 more sources
Journal of Combinatorial Theory, Series B, 1981 AbstractLet G be a directed graph on n vertices (single loops allowed) such that there are λ directed paths of length k from P to Q for any distinct pair of vertices (P, Q). We prove that if n > 2 and k > 2, G is regular. The regular case is also discussed.
Bridges, W.G, Mena, R.A
openaire +2 more sources
Infinite kernel perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a ...
Rocío Sánchez-López
doaj +1 more source
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization [PDF]
, 1977 F Boesch, James F. Gimpel
openalex +1 more source
The communication problem on graphs and digraphs [PDF]
, 1974 Frank Harary, Allen J. Schwenk
openalex +1 more source
Signed Total Roman Domination in Digraphs
Discussiones Mathematicae Graph Theory, 2017 Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz
doaj +1 more source
Applied Mathematics in Science and EngineeringThe Halpern iteration method is among the most extensively studied approaches in the literature concerning the approximation of fixed points of G-nonexpansive mappings.
Esra Yolaçan
doaj +1 more source