Results 91 to 100 of about 8,914 (221)

The Uniqueness of Almost Moore Digraphs with Degree 4 And Diameter 2

open access: yesJournal of Mathematical and Fundamental Sciences, 2019
. It is well known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist. For degrees 2 and 3, it has been shown that for diameter k ≥ 3 there are no almost Moore digraphs, i.e.
Rinovia Simanjuntak, Edy Tri Baskoro
doaj  

The Clique-Width of Minimal Series-Parallel Digraphs

open access: yesAlgorithms
MSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition.
Frank Gurski, Ruzayn Quaddoura
doaj   +1 more source

Causal Relationship Between ESG Assessment Criteria and SDGs for PPP Projects: A Fuzzy Cognitive Approach

open access: yesSustainable 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

Contemporary and Future Challenges for Structured Democratic Dialogue

open access: yesSystems 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

Lexical Syllabus in Elementary and Secondary Education: Construction and Implementation

open access: yesTESOL Quarterly, EarlyView.
Abstract Nonnative language users operate with significantly limited vocabularies compared to native speakers, particularly when the language is learnt in school contexts. This paper demonstrates how empirical research on vocabulary learning combined with experience in teaching and curricula design has informed the principled construction of a lexical ...
Batia Laufer
wiley   +1 more source

Word Associations in a Minoritised Language: The Case of Cymraeg (Welsh)

open access: yesInternational Journal of Applied Linguistics, EarlyView.
ABSTRACT As with many research strands in linguistics, word association (WA) literature is dominated by English language data. This paper (i) explores the extent to which methodologies developed to date are applicable to other languages—specifically, Welsh (Cymraeg)—and (ii) investigates what WA analysis can reveal about lexical organisation and ...
Tess Fitzpatrick   +2 more
wiley   +1 more source

Local Energy of Digraphs

open access: yesMathematics
Theenergy of a graph is a classical spectral invariant defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. Recently, the notion of local energy was introduced to measure the contribution of vertices to the total energy ...
Carlos Espinal, Juan Rada
doaj   +1 more source

Challenges to artificial intelligence‐enabled digital technology adoption in farms: a multi‐method approach

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Artificial intelligence (AI)‐enabled digital technologies have the potential to transform agriculture by supporting decision‐making and automating operations. However, their limited adoptions and scholars’ atheoretical explorations constrain our understanding.
Guoqing Zhao   +5 more
wiley   +1 more source

Infinite kernel perfect digraphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a ...
Rocío Sánchez-López
doaj   +1 more source

Context‐free graphs and their transition groups

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy