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)
- Title
- Constructing featured supereulerian graph
- Creators - without role
- Mansour J. Algefari - Qassim University
- Publication Details
- Journal of discrete mathematical sciences & cryptography, Vol.25(8), pp.2729-2738
- Publisher
- Taylor & Francis
- Identifiers
- 9928866108331
- Academic Unit
- Qassim University
- Language
- English
- Resource Type
- Journal article