Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only ...

We only store the ones whose underlying cubic graph was "new" at the time of its generation. You can distinguish between these graphs from the ones generated by nauty because they have vertex indices ...

Dynamic uncertain causality graph (DUCG) provides a dynamic inference method without causality propagation across time slices, the disadvantage of which lies in the interpretability and applicability.

To meet the demand for dynamic and highly reliable real-time fault diagnosis for complex systems, we extend the dynamic uncertain causality graph (DUCG) by proposing novel temporal causality modeling ...