Results 81 to 90 of about 48,688 (228)
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley +1 more source
Developing a Sustainability Index for Implementing Big Data Analytics in the Logistics Sector
Sustainable Development, Volume 33, Issue S1, Page 1271-1291, November 2025.ABSTRACT This study identifies Critical Success Factors (CSFs) for implementing Big Data Analytics (BDA) for sustainable logistics practices in the context of an emerging economy. Through a combination of literature review and experts' opinions, the study identifies 18 CSFs essential for the effective application of BDA in the logistics sector.
Anchal Gupta +2 more
wiley +1 more source
The k-Rainbow Bondage Number of a Digraph
Discussiones Mathematicae Graph Theory, 2014 Let D = (V,A) be a finite and simple digraph. A k-rainbow dominating function (kRDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V with f(v) = Ø the condition ∪u∈
J. Amjadi +3 more
semanticscholar +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
International Journal of Applied Mathematics and Computer Science, 2018 In the last two decades, fractional calculus has become a subject of great interest in various areas of physics, biology, economics and other sciences. The idea of such a generalization was mentioned by Leibniz and L’Hospital.
Markowski Konrad Andrzej
doaj +1 more source
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
Journal of Graph Theory, Volume 110, Issue 2, Page 127-131, October 2025.ABSTRACT An oriented graph D is converse invariant if, for any tournament T, the number of copies of D in T is equal to that of its converse − D. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse
Jiangdong Ai +4 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
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
A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs
Journal of Graph Theory, Volume 110, Issue 2, Page 200-208, October 2025.ABSTRACT Let G be a graph in which each edge is assigned one of the colours 1 , 2 , … , m, and let Γ be a subgroup of S m. The operation of switching at a vertex x of G with respect to an element π of Γ permutes the colours of the edges incident with x according to π.
Richard Brewster +2 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