Supereulerian digraphs with given diameter

Changchang Dong, Juan Liu and Xindong Zhang

Applied Mathematics and Computation, 2018, vol. 329, issue C, 5-13

Abstract: A digraph D is supereulerian if D has a spanning eulerian subdigraph. Let diam(D) denote the diameter of D. In this paper, we obtain sufficient conditions on digraph to be supereulerian for given diameter. In particular, we prove that if a digraph D with diam(D) ≤ 2, then D is supereulerian. And for a bipartite digraph D, if diam(D) ≤ 3, then it is supereulerian.

Keywords: Supereulerian digraph; Spanning closed ditrail; Distance; Diameter (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318300754
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:329:y:2018:i:c:p:5-13

DOI: 10.1016/j.amc.2018.01.052

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().