Partition-based construction and stability analysis of Euler graphs using vertex strength

DOI10.1007/S44426-026-00066-8MaRDI QIDQ7318245zbMATH OpenFDO

Authors Saifur Rahman, Raju Doley

Publication date 24 August 2026

Published in Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S44426-026-00066-8

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites work

• An application of modular equations in analysis situs.
• An Eulerian exposition
• Complex networks: from graph theory to biology
• Complexity of stability
• Computation of topological indices of some graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Graph theory with applications
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• On the possibility, to travel around a graph without repetition and without cutting
• Properties of a Euler graph
• Recharacterizing Eulerian: Intimations of new duality

This page was built for publication: Partition-based construction and stability analysis of Euler graphs using vertex strength

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318245)