Results 51 to 60 of about 16,499 (231)
Rainbow vertex connection of digraphs [PDF]
Journal of combinatorial optimization, 2017 An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow connected if any two vertices are connected by
H. Lei +3 more
semanticscholar +1 more source
From Subkautz Digraphs to Cyclic Kautz Digraphs [PDF]
Journal of Interconnection Networks, 2018 The Kautz digraphs K(d, ℓ) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to these, the cyclic Kautz digraphs CK(d, ℓ) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed.
openaire +3 more sources
On Relations between Neighborhoods of Threshold and Ferrers Digraphs
Journal of Graph Algorithms and ApplicationsFerrers digraphs have linearly nested in- and out-neighborhoods that define two rankings on the vertices. Removing the loops turns Ferrers into threshold digraphs in which the neighborhoods are no longer nested in general.
Gordana Marmulla, Ulrik Brandes
doaj +1 more source
Combinatorica, 2017 The chromatic number of a digraph D is the minimum number of acyclic subgraphs covering the vertex set of D. A tournament H is a hero if every H-free tournament T has chromatic number bounded by a function of H.
Ararat Harutyunyan +3 more
semanticscholar +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
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs [PDF]
Discrete Mathematics, 2018 A digraph $D=(V,A)$ has a good decomposition if $A$ has two disjoint sets $A_1$ and $A_2$ such that both $(V,A_1)$ and $(V,A_2)$ are strong. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has ...
Yuefang Sun, G. Gutin, J. Ai
semanticscholar +1 more source
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaishun Wang, Yan-Quan Feng
openaire +2 more sources
Total rainbow connection of digraphs [PDF]
Discrete Applied Mathematics, 2017 An edge-coloured path is rainbow if its edges have distinct colours. For a connected graph G , the rainbow connection number (resp. strong rainbow connection number) of G is the minimum number of colours required to colour the edges of G so that any two ...
H. Lei +3 more
semanticscholar +1 more source
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
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