Results 81 to 90 of about 28,427 (196)
On the Cayley digraphs that are patterns of unitary matrices
, 2002 A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero. Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology and quantum computation.
Severini, Simone
core +1 more source
Energy Science &Engineering, Volume 14, Issue 1, Page 236-256, January 2026.The study analyzes barriers to electric vehicle growth in India using DEMATEL and ANP. It distinguishes cause‐and‐effect barriers and ranks them. Major barriers include poor charging infrastructure and high costs. ABSTRACT This study employs a hybrid technique based on the Decision‐Making Trial Evaluation Laboratory (DEMATEL), Analytic Network Process (
Sanjeev Kumar +6 more
wiley +1 more source
Infinite kernel perfect digraphs
AKCE 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
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
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
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
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
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source
Directed graph theory for the analysis of biological regulatory networks
Frontiers in Applied Mathematics and StatisticsSynchronous regulated biological networks are often represented as logical diagrams, where the precise interactions between elements remain obscured. Here, we introduce a novel type of excitation-inhibition graph based on Boolean logic, which we term ...
Martha Takane +8 more
doaj +1 more source
Normally Regular Digraphs [PDF]
The Electronic Journal of Combinatorics, 2015 A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$, a pair of non-adjacent vertices have $\mu$ common out-neighbours, a pair of vertices connected by an edge in one ...
openaire +4 more sources