Results 51 to 60 of about 34,455 (233)
The maximal spectral radius of a digraph with (m+1)^2 - s edges
, 2003 It is known that the spectral radius of a digraph with k edges is \le \sqrt{k}, and that this inequality is strict except when k is a perfect square. For k=m^2 + \ell, \ell fixed, m large, Friedland showed that the optimal digraph is obtained from the ...
Snellman, Jan
core +1 more source
That's Not What I Was Promised! Psychological Contracts and Quiet Quitting
Human Resource Management, EarlyView.ABSTRACT The phrase “quiet quitting” has become a popular topic within the workplace and academia. However, the nomological network of quiet quitting is unclear. We contribute to quiet quitting research by incorporating organizational justice and job characteristics theories with a psychological contract and social exchange lens to illuminate ...
Truit W. Gray +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1976 AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancyclic unless it is one of the graphs Kp,p. This generalizes a result of A. Ghouila-Houri. We disprove a conjecture of J. A. Bondy by showing that there exist hamiltonian digraphs with n vertices and 12n(n + 1) – 3 edges which are not pancyclic.
Carsten Thomassen, Roland Häggkvist
openaire +3 more sources
Minimum‐Peak‐Cost Flows Over Time
Networks, EarlyView.ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska +7 more
wiley +1 more source
H-kernels by walks in H-colored digraphs and the color-class digraph
AKCE International Journal of Graphs and Combinatorics, 2016 Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Discrete Mathematics, 2012 We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to directed graphs, while the second characterization says a digraph is split if and only if its degree sequence satisfies ...
openaire +2 more sources
Networks, EarlyView.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
Penyelesaian masalah biaya minimal pada jaringan circulatory dengan algoritma out-of-kilter [PDF]
, 2000 Permasalahan jaringan biaya minimal merupakan permasalahan program Tinier yang disajikan ke dalam bentuk digraph atau network yang telah diketahui kapasitas dan bobot dari masing-masing arcnya.
Santoso , Haryo
core
A sufficient condition for a balanced bipartite digraph to be hamiltonian
, 2017 We describe a new type of sufficient condition for a balanced bipartite digraph to be hamiltonian. Let $D$ be a balanced bipartite digraph and $x,y$ be distinct vertices in $D$.
Wang, Ruixia
core +1 more source
Infinite digraphs isomorphic with their line digraphs
Journal of Combinatorial Theory, Series B, 1976 In this paper we give a structural characterization of the digraphs that are isomorphic with their line digraphs.
Lowell W. Beineke, Robert L. Hemminger
openaire +2 more sources