Results 81 to 90 of about 8,914 (221)
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
EXTREMAL IOTA ENERGY OF A SUBCLASS OF TRICYCLIC DIGRAPHS AND SIDIGRAPHS [PDF]
Matrix Science Mathematic, 2018 The iota energy of an n-vertex digraph D is defined by Ec (𝐷) = ∑ 1 |Im(𝑧 k)|, where z1, . . ., zn are eigenvalues of D and Im(zk) is the imaginary part of eigenvalue zk . The iota energy of an n-vertex sidigraph can be defined analogously.
Fareeha Jamal, Mehtab Khan
doaj +1 more source
Simultaneous Network Design With Restricted Link Usage
Networks, EarlyView.ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura +3 more
wiley +1 more source
digraphs/Digraphs: Digraphs 1.7.0
<p>Release for Digraphs</p ...
Markus Pfeiffer +23 more
core +1 more source
Exponents of two-colored digraphs [PDF]
, 2009 summary:We consider the primitive two-colored digraphs whose uncolored digraph has $n+s$ vertices and consists of one $n$-cycle and one $(n-3)$-cycle.
Shao, Yanling, Gao, Yubin
core +2 more sources
A remark on the second neighborhood problem
Electronic Journal of Graph Theory and Applications, 2015 Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP).
Salman Ghazal
doaj +1 more source
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Jean-Claude Bermond +3 more
openaire +3 more sources
Sustainable Development, EarlyView.ABSTRACT The circular economy (CE) is increasingly promoted as a strategy for addressing environmental degradation and resource inefficiencies. Despite growing policy support, CE implementation remains fragmented in many resource‐intensive industries, particularly in emerging economies. This study investigates barriers to CE adoption in China's textile
Muhammad Shahjahan Usmani
wiley +1 more source
digraphs/Digraphs: Digraphs 1.7.1
<p>Release for Digraphs</p ...
Markus Pfeiffer +24 more
core +1 more source
07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs
, 2007 The following is a list of the problems presented on Monday, July 9, 2007 at the open-problem session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, held at Schloss Dagstuhl in Wadern ...
Stege, Ulrike +3 more
core +1 more source