Results 51 to 60 of about 6,654 (223)
Building Blocks of Upward Planar Digraphs
Journal of Graph Algorithms and Applications, 2007 The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross.
Patrick Healy, Karol Lynch
doaj +1 more source
Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints
Discussiones Mathematicae Graph Theory, 2022 Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.
Lyu Zhenhua
doaj +1 more source
Discrete Applied Mathematics30 pages, 17 figures, 5 tables, 61 ...
Nino Basic +3 more
openaire +3 more sources
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
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph [PDF]
, 1992 Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph.
Fiol Mora, Maria Lluïsa +2 more
core +2 more sources
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
Some Remarks On The Structure Of Strong K-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2014 A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense.
Hernández-Cruz César +1 more
doaj +1 more source
Computers & Mathematics with Applications, 1997 The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are ...
Chartrand, G., Tian, S.
openaire +1 more source
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT Growing concerns about the environmental and social consequences of plastics around the world, manufacturing industries are associated with business are focusing on sustainable end‐of‐life options‐based solutions which aim at increasing the product life cycle.
Sivakumar Kirupanandan +3 more
wiley +1 more source
European Journal of Combinatorics, 1998 For a digraph \(G= (V,E)\) let \(\omega(G^n)\) denote the maximum possible cardinality of a subset \(S\) of \(V^n\) in which for every ordered pair of \(n\)-tuples \((u_1, u_2,\dots, u_n)\) and \((v_1, v_2,\dots, v_n)\) of members of \(S\) there is some \(i\) with \(1\leq i\leq n\) such that \((u_i,v_i)\in E\). The capacity \(C(G)\) of \(G\) is \(C(G)=
openaire +2 more sources