Results 1 to 10 of about 1,487 (69)
On the domination number of $t$-constrained de Bruijn graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely $t$-constrained de Bruijn graphs, where
Tiziana Calamoneri +2 more
doaj +1 more source
Domination in Fuzzy Directed Graphs
Mathematics, 2021 A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of domination in a fuzzy graph and a directed graph. Let GD*=V,A be a directed simple graph, where V is a finite nonempty set and A=x,y:x,y∈V,x≠y.
Enrico Enriquez +4 more
doaj +1 more source
Planar L-Drawings of Directed Graphs
Computing in Geometry and Topology, 2023 In this paper, we study drawings of directed graphs. We use the L-drawing standard where each edge is represented by a polygonal chain that consists of a vertical line segment incident to the source of the edge and a horizontal line segment ...
Steven Chaplick +7 more
doaj +1 more source
Coordination Games on Directed Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their ...
Krzysztof R. Apt +2 more
doaj +1 more source
A Study on Semi-directed Graphs for Social Media Networks
International Journal of Computational Intelligence Systems, 2021 In the literature of graph theory, networks are represented as directed graphs or undirected graphs and a mixed of both combinations. In today's era of computing, networks like brain and facebook that do not belong to any of the mentioned networks ...
Sovan Samanta +4 more
doaj +1 more source
Hermitian Laplacian Matrix of Directed Graphs [PDF]
Jisuanji kexue, 2023 Laplacian matrix plays an important role in the research of undirected graphs.From its spectrum,some structure and properties of a graph can be deduced.Based on this,several efficient algorithms have been designed for relevant tasks in graphs,such as ...
LIU Kaiwen, HUANG Zengfeng
doaj +1 more source
Sombor index of directed graphs
Heliyon, 2022 Let D be a digraph with set of arcs A. The Sombor index of D is defined asSO(D)=12∑uv∈A(du+)2+(dv−)2,where du+ and dv− are the out-degree and in-degree of the vertices u and v of D.
Roberto Cruz, Juan Monsalve, Juan Rada
doaj +1 more source
Characterizing DAG-depth of Directed Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on ...
Matúš Bezek
doaj +1 more source
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +1 more source
Effective Computation of a Feedback Arc Set Using PageRank
Journal of Graph Algorithms and Applications, 2023 Computing a minimum Feedback Arc Set (FAS) is important for visualizing directed graphs in hierarchical style. It is the first step of both known frameworks for hierarchical graph drawing of directed graphs and it is NP-hard.
Vasileios Geladaris +2 more
doaj +1 more source