Results 51 to 60 of about 8,914 (221)
Proceedings of the American Mathematical Society, 2016 A majority digraph is a finite simple digraph G = ( V ,
Lai, Tri +2 more
openaire +4 more sources
On structural controllability in complex networks with periodic switching topologies
Asian Journal of Control, EarlyView.Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Existence and uniqueness of solutions to the norm minimum problem on digraphs
Open Mathematics, 2022 In this article, based on the path homology theory of digraphs, which has been initiated and studied by Grigor’yan, Lin, Muranov, and Yau, we prove the existence and uniqueness of solutions to the problem ∥w∥=minu∈Ω2(G),u≠012∥∂u−w∥22+∣u∣1\parallel w ...
Wang Chong
doaj +1 more source
Practising Digital Product Passport for Circular Supply Chain: Ecosystem Orchestration Perspective
Business Strategy and the Environment, EarlyView.ABSTRACT Digital product passports (DPP) are emerging as an important tool to support industries in realising circular supply chain (CSC) practices. However, small and medium‐sized enterprises (SMEs) remain constrained by various challenges in implementing DPP.
Martin Agyemang +3 more
wiley +1 more source
Which Faber–Moore–Chen digraphs are Cayley digraphs? [PDF]
, 2010 The problem of finding the largest graphs and digraphs of given degree and diameter is known as the ‘degree–diameter’ problem. One of the families of largest known vertex-transitive digraphs of given degree and diameter is the Faber–Moore–Chen digraphs ...
Staneková, Ľubica +1 more
core +1 more source
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, 2013 To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Rice production sustains food security and rural livelihoods across many low‐income countries but remains highly vulnerable to climate‐related hazards, including floods, droughts, salinity intrusion and heat stress, which reduce yields and threaten the long‐term sustainability of rice production.
Apurbo Sarkar +4 more
wiley +1 more source
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 We prove that the game-perfect digraphs defined by Andres (2012) with regard to a digraph version of the maker-breaker graph colouring game introduced by Bodlaender (1991) always have a kernel.
Stephan Dominique Andres
doaj +1 more source
Revisiting the Latin Vocabulary of Terminologia Histologica: II. Adjectives and Participles
Clinical Anatomy, EarlyView.ABSTRACT Terminologia Histologica, the international standard nomenclature of human histology and cytology, contains 1093 Latin words that appear to be used as adjectives. Among these, we identified 56 (5%) with a variety of linguistic issues, including typographical or spelling errors, less favored spelling variants, and several unfortunate word ...
Paul E. Neumann +7 more
wiley +1 more source
, 2016 <p>This is a minor release containing one bugfix and several other minor changes.<br> Digraphs now works when it and GAP are compiled in 32 bit mode.</p ...
Torpey, Michael +11 more
core +1 more source