Results 31 to 40 of about 1,242,256 (73)
Extremal results on feedback arc sets in digraphs
Random Structures &Algorithms, Volume 64, Issue 2, Page 287-308, March 2024.Abstract For an oriented graph G$$ G $$, let β(G)$$ \beta (G) $$ denote the size of a minimum feedback arc set, a smallest edge subset whose deletion leaves an acyclic subgraph. Berger and Shor proved that any m$$ m $$‐edge oriented graph G$$ G $$ satisfies β(G)=m/2−Ω(m3/4)$$ \beta (G)=m/2-\Omega \left({m}^{3/4}\right) $$.
Jacob Fox, Zoe Himwich, Nitya Mani
wiley +1 more source
The Lights Out Game on Directed Graphs [PDF]
, 2023 We study a version of the lights out game played on directed graphs. For a digraph $D$, we begin with a labeling of $V(D)$ with elements of $\mathbb{Z}_k$ for $k \ge 2$.
Dettling, T. Elise, Parker, Darren B.
core +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Random Directed Graph Distributions in the Triad Census in Social Networks [PDF]
This paper uses the concept of the triad census first introduced by Holland and Leinhardt, and describes several distributions on directed graphs. Methods are presented for calculating the mean and the covariance matrix of the triad census for the ...
Stanley S. Wasserman
core
Ranking the nodes in directed and weighted directed graphs [PDF]
Graphs ...
Gilles, R.P., Brink, J.R. van den
core
Sombor index of directed graphs. [PDF]
Heliyon, 2022 Cruz R, Monsalve J, Rada J.
europepmc +1 more source
Ferrers digraphs and threshold graphs [PDF]
, 1982 We deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of characterizations of Ferrers digraphs (Theorem 1) by investigating the connection between symmetric Ferrers digraphs and threshold graphs.
Cogis, Olivier
core +1 more source
, 2011 In this note we define two generalizations of the line graph and obtain some results.
Reddy, P. Siva Kota Kavita +2 more
core +1 more source
, 2017 International audienceThe dichromatic number χ(D) of a digraph D is the least number k such that the vertex set of D can be partitioned into k parts each of which induces an acyclic subdigraph.
Ararat Harutyunyan +5 more
core +1 more source
A new model for predicting the winner in tennis based on the eigenvector centrality. [PDF]
Ann Oper Res, 2023 Arcagni A, Candila V, Grassi R.
europepmc +1 more source