Results 81 to 90 of about 8,697 (224)
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Jean-Claude Bermond +3 more
openaire +3 more sources
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
Neutrosophic Digraph with Generalized Modus Tollens
, 2022 In this paper, we generalize modus tollens method for neutrosophic digraph by using neutrosophic ruleand define degree of a vertex in neutrosophic digraph, Indegree of a vertex in neutrosophic digraph, out degree ofa vertex in neutrosophic digraph and ...
Elsayed Badr, Shokry Nada, Ashraf ELrokh, Hoda Mostafa
core +1 more source
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +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
Tree-average distances on certain phylogenetic networks have their weights uniquely determined
Algorithms for Molecular Biology, 2012 A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head.
Willson Stephen J
doaj +1 more source
Contemporary and Future Challenges for Structured Democratic Dialogue
Systems Research and Behavioral Science, EarlyView.ABSTRACT Structured Democratic Dialogue (SDD) is a participatory problem structuring methodology grounded in Structured Dialogic Design Science. It was created to help diverse stakeholders co‐construct influence maps that reveal leverage points and support coordinated action.
Yiannis Laouris, Gerald Midgley
wiley +1 more source
SYARAT PERLU DAN CUKUP ISOMORFISMA DIGRAPH [PDF]
, 2004 Berdasarkan definisi isomortisma digraph, dapat ditentukan apaknh dua digraph isomorfis atau tidak. Tetapi, untuk menentukan isomorfisma digraph yang banyaknya titik dan garis berarahnya cukup besar tidaklah mudah dan memakan banyak waktu.
KHOLIFAH, 080012237
core +1 more source
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source
The Burning Number of Directed Graphs: Bounds and Computational Complexity
Theory and Applications of Graphs, 2020 The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj +1 more source