Abstract
A graph is supereulerian if it has a spanning eulerian subgraph. In this paper we construct a supereulerian graph controlling its matching number, minimum degree and edge connectivity, where δ(G) < α′(G)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
