Abstract
A digraph D is supereulerian if D has a spanning connected eule-rian subdigraph. In this paper, we construct a supereulerian digraph controlling its matching number, vertices, arcs and arc-connectivity.
- Title
- Constructing Supereulerian Digraphs by Control Function of Arc-Connectivity and Matching Number
- Creators - without role
- Mansour J. Algefari - Qassim University
- Publication Details
- International journal of mathematics and computer science, Vol.17(1), pp.353-364
- Publisher
- Lebanese Univ
- Number of pages
- 12
- Identifiers
- 9928894208331
- Academic Unit
- Qassim University
- Language
- English
- Resource Type
- Journal article