Results 51 to 60 of about 8,697 (224)
DIGRAPH EKSENTRIS DARI DIGRAPH [PDF]
, 2002 penelitian ini bertujuan untuk mengetahui bentuk digraph eksentris dari ...
SULISTYOWATI, 089711567
core +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
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
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
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 +3 more sources
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaishun Wang, Yan-Quan Feng
openaire +3 more sources
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
Journal of Graph Theory, EarlyView.ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley +1 more source
THE ROMAN BONDAGE NUMBER OF A DIGRAPH
, 2016 Let D=(V,A)D=(V,A) be a finite and simple digraph. A Roman dominating function on DD is a labeling f:V(D)→{0,1,2}f:V(D)→{0,1,2} such that every vertex with label 0 has an in-neighbor with label 2.
Sheikholeslami, Seyed Mahmoud;Dehgardi, Nasrin;Volkmann, Lutz;Meierling, Dirk +4 more
core +1 more source
Exact and Approximate Digraph Bandwidth [PDF]
, 2019 In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately.
Jain, Pallavi +4 more
core +1 more source