Results 11 to 20 of about 1,263,669 (205)
About Directed d-Convex Simple Graphs [PDF]
Computer Science Journal of Moldova, 2008 In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj +1 more source
Tr-Span of Directed Wheel Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +2 more sources
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj +3 more sources
Directed communication in games with directed graphs [PDF]
, 2023 We introduce a novel concept of directed communication and a related connectedness in directed graphs, and apply this to model certain cooperation restrictions in cooperative games.
Van den Brink, René +2 more
core +2 more sources
Detours in Directed Graphs [PDF]
, 2022 We study two "above guarantee" versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, the task is to decide whether a ...
Fomin, Fedor +8 more
core +1 more source
Classifying Higher Rank Toeplitz Operators. [PDF]
, 2007 To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core +2 more sources
Asteroidal Quadruples in non Rooted Path Graphs
Discussiones Mathematicae Graph Theory, 2015 A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +1 more source
Opuscula Mathematica, 2011 It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
doaj +1 more source
Topological Decomposition of Directed Graphs
Journal of Graph Algorithms and Applications, 2017 The analysis of directed graphs is important in application areas like software engineering, bioinformatics, or project management. Distinguishing between topological structures such as cyclic and hierarchical subgraphs provides the analyst with ...
Ala Abuthawabeh, Dirk Zeckzer
doaj +1 more source
Flows in One-Crossing-Minor-Free Graphs
Journal of Graph Algorithms and Applications, 2013 We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given, we show that a ...
Erin Wolf Chambers, David Eppstein
doaj +1 more source