Vertex degree sums for supereulerian bipartite digraphs

Jiaqi Li and Yi Zhang

Applied Mathematics and Computation, 2024, vol. 475, issue C

Abstract: A digraph is considered supereulerian if it possesses a spanning closed ditrail. Let n be positive integer and Dn,n be a bipartite digraph, whose vertices are divided into two equal parts of size n. If Dn,n is strongly connected and δ−+δ+≥n+1, where δ− is its minimum in-degree and δ+ is its minimum out-degree, then Dn,n is supereulerian digraph.

Keywords: Bipartite digraph; Supereulerian; Vertex degree sums (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032400225X
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:475:y:2024:i:c:s009630032400225x

DOI: 10.1016/j.amc.2024.128755

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 ().