Results 31 to 40 of about 4,954 (163)

Cycles and transitivity by monochromatic paths in arc-coloured digraphs

AKCE International Journal of Graphs and Combinatorics, 2015
A digraph D is an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a∈A(D), then colour(a) will denote the colour has been used on a.
Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy   +2 more
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, Hernández-Cruz, César, Juárez-Camacho, Manuel Alejandro   +2 more
core   +1 more source

Towards transitive-free digraphs

Theoretical Computer Science
In a digraph $D$, an arc $e=(x,y) $ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D- e$. A digraph is transitive-free if it does not contain any transitive arc. In the Transitive-free Vertex Deletion (TVD) problem, the goal is to find at most $k$ vertices $S$ such that $D-S$ has no transitive arcs.
Ankit Abhinav, Satyabrata Jana, Abhishek Sahu   +2 more
openaire   +3 more sources

Highly Arc Transitive Digraphs

European Journal of Combinatorics, 1989
A digraph is said to be (G,s) transitive if G acts as a group of automorphisms which is transitive on length s edge sequences. The author constructs examples \(C_ r(v,s)\) with vertex set \(Z_ r\times Z^ s_ v\) with automorphism group \(S_ v\) wr \(Z_ r\) and shows it is (G,s) arc transitive but not \((G,s+1)\) arc transitive for any s.
openaire   +2 more sources

Reachability relations, transitive digraphs and groups

Ars Mathematica Contemporanea, 2014
In A. Malnic, D. Marusic, N. Seifter, P. Sparl and B. Zgrablic, Reachability relations in digraphs, Europ. J. Combin. 29  (2008), 1566–1581, it was shown that properties of digraphs such as growth, property Z , and number of ends are reflected by the properties of certain reachability relations defined on the vertices of the corresponding digraphs.
Malnič, Aleksander, Potočnik, Primož, Seifter, Norbert, Šparl, Primož   +3 more
openaire   +4 more sources

Existence of acyclic matching and Morse complex on transitive digraphs

AKCE International Journal of Graphs and Combinatorics
For any digraph, there exists a transitive closure. The transitive digraph is a discrete geometric object which has a close relationship with simplicial complex.
Chong Wang, Shiquan Ren
doaj   +1 more source

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

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, Shaofeng Liu, Xiaoning Chen, Huilan Chen, Xinyi Li, Guoste Pivoraite   +5 more
wiley   +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, Samah Souleh, Omaima Munawar Albadry, Saeyeon Roh, Adah‐Kole Emmanuel Onjewu   +4 more
wiley   +1 more source

Challenges to Industry 4.0 Implementation: Identification and Modelling for Smart and Sustainable Production

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, Kuldip Singh Sangwan, Perminderjit Singh, Narpat Ram Sangwa, Shubham Sharma, Krishna Prakash Arunachalam, Mohamed Abbas, Krishnaraj Ramaswamy   +7 more
wiley   +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, Kwon, Young Soo, Lee, Jaeun   +2 more
core   +1 more source