Results 31 to 40 of about 9,505,081 (140)
Circulant digraph isomorphisms [PDF]
, 2016 We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two ...
Cancela, Elias Damian, Cancela, Elias
core
The homology digraph of a preordered space [PDF]
, 2023 This paper studies a notion of directed homology for preordered spaces, called the homology digraph. We show that the homology digraph is a directed homotopy invariant and establish variants of the main results of ordinary singular homology theory for ...
Kahl, Thomas, Faustino, Catarina
core
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
CAYLEY COLOR DIGRAPH DARI GRUP SIKLIK DENGAN n BILANGAN PRIMA [PDF]
, 2013 Abstrak Penelitian ini merupakan penelitian deskriptif-kualitatif dengan menggunakan metode penelitian kepustakaan (Library Research) yaitu penelitian yang mengkaji kepustakaan, khususnya tentang Cayley Color Digraf dengan tujuan untuk mengumpulkan ...
Jalil, Abdul
core
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
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
A digraph group is a group defined by non-empty presentation with the property that each relator is of the form R(x, y), where x and y are distinct generators and R(·, ·) is determined by some fixed cyclically reduced word R(a, b) that involves both a ...
Williams, Gerald, Cihan, Mehmet Sefa
core +1 more source
A Note on Almost Moore Diagraphs of Degree Three
Journal of Mathematical and Fundamental Sciences, 2019 It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one.
Edy Tri Baskoro +2 more
doaj
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
Sustainable Development, EarlyView.ABSTRACT Environmental, Social and Governance (ESG) assessment criteria have received substantial recognition for investment decision and practical steps to achieving the sustainable development goals (SDGs). Given the global reliance on public‐private partnership (PPP) to bridge infrastructure deficit, investment into these projects is on the rise; it
Caleb Boadi +2 more
wiley +1 more source