Results 11 to 20 of about 4,536 (107)
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets [PDF]
, 2012 An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$.
A. Winter +15 more
core +4 more sources
Semi-Transitive Orientations and Word-Representable Graphs [PDF]
, 2015 A graph $G=(V,E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$.
Halldórsson, Magnús M. +2 more
core +2 more sources
On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
Discussiones Mathematicae Graph Theory, 2014 Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V (D) − N there exists v ∈ N such that d(u, v)
Hell Pavol, Hernández-Cruz César
doaj +1 more source
On the existence and number of $(k+1)$-kings in $k$-quasi-transitive digraphs
, 2012 Let $D=(V(D), A(D))$ be a digraph and $k \ge 2$ an integer. We say that $D$ is $k$-quasi-transitive if for every directed path $(v_0, v_1,..., v_k)$ in $D$, then $(v_0, v_k) \in A(D)$ or $(v_k, v_0) \in A(D)$.
Galeana-Sánchez, Hortensia +2 more
core +1 more source
Enumerations of finite topologies associated with a finite graph
, 2012 The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In this article, we
Kim, Dongseok +2 more
core +1 more source
International 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
Oriented coloring on recursively defined digraphs
, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank +2 more
core +1 more source
Unpacking Entrepreneurial Ecosystem Elements: Insights Into Drivers of Entrepreneurial Activity
Thunderbird International Business Review, Volume 68, Issue 1, Page 3-15, January/February 2026.ABSTRACT Thriving entrepreneurial ecosystems (EEs) are instrumental in new enterprise creation and growth, as they provide vital support for entrepreneurial activity. However, as this support may be context‐specific, the existing literature has yet to capture the contextual factors that shape the contributions of EEs.
Mohamed Yacine Haddoud +4 more
wiley +1 more source
IET Collaborative Intelligent Manufacturing, Volume 8, Issue 1, January/December 2026.To identify the I4.0 challenges and sub‐challenges by using literature review for the ready reference of practitioners and future researchers. To develop hierarchical models (Interpretive Structural Modelling [ISM] and Interpretive Ranking Process [IRP]) of the identified challenges for their effective mitigation for the successful adoption of I4.0 ...
Rupen Trehan +7 more
wiley +1 more source
A systematic approach for identifying drivers of critical safety and establishing their hierarchy
The Canadian Journal of Chemical Engineering, Volume 103, Issue 10, Page 4628-4646, October 2025.Abstract Learning from incidents is a crucial step in preventing and mitigating adverse events. Incident databases offer valuable insights for safety management improvements by cause and contributing factors. However, extracting meaningful information from incident investigation reports poses a significant challenge. This study introduces a data‐driven
Mohammad Zaid Kamil +2 more
wiley +1 more source