Results 81 to 90 of about 27,993 (181)

Minimal positive realizations of linear continuous-time fractional descriptor systems: Two cases of an input-output digraph structure

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

That's Not What I Was Promised! Psychological Contracts and Quiet Quitting

open access: yesHuman Resource Management, Volume 64, Issue 6, Page 1833-1863, November/December 2025.
ABSTRACT The phrase “quiet quitting” has become a popular topic within the workplace and academia. However, the nomological network of quiet quitting is unclear. We contribute to quiet quitting research by incorporating organizational justice and job characteristics theories with a psychological contract and social exchange lens to illuminate ...
Truit W. Gray   +3 more
wiley   +1 more source

Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth

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

The Burning Number of Directed Graphs: Bounds and Computational Complexity

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

On the Cayley digraphs that are patterns of unitary matrices

open access: yes, 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 Reformulation of Matrix Graph Grammars with Boolean Complexes [PDF]

open access: yes, 2009
Prior publication in the Electronic Journal of Combinatorics.Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory.
Lara, Juan de   +1 more
core   +2 more sources

Developing a Sustainability Index for Implementing Big Data Analytics in the Logistics Sector

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

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

A systematic approach for identifying drivers of critical safety and establishing their hierarchy

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

Tree-average distances on certain phylogenetic networks have their weights uniquely determined

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

Home - About - Disclaimer - Privacy