GitHub

Classifying Eulerian and Hamiltonian graphs and implementing algorithms to identify and trace their characteristic circuit paths.

In 1736, Leonhard Euler showed that there was no way to travel across the Seven Bridges of Königsberg, crossing each bridge a single time and ending up where you started. He did this by showing that ...
IEEE

Sneak Circuit Analysis for n-stage Resonant Switched Capacitor Converters Based on Graph Theory

Abstract: Sneak circuit is a latent circuit path or condition that causes undesired function to occur at some certain conditions. Sneak circuit phenomena were found in resonant switched capacitor (RSC ...
GitHub

Shriram-10/Combinatorics-and-Graph-Theory

This program demonstrates several key graph theory algorithms and functionalities, including graph generation using the Havel-Hakimi algorithm, detecting Eulerian circuits with Fleury's algorithm, and ...
IEEE

Convergence-boosted graph partitioning using maximum spanning trees for iterative solution of large linear circuits

Abstract: The ability to solve large linear systems efficiently has been a key part of building a successful circuit simulator such as ones for power grid analysis. Partition-based iterative methods ...