A Note on Directed 5-Cycles in Digraphs - Applied Mathematics

AM > Vol.3 No.7, July 2012

A Note on Directed 5-Cycles in Digraphs ()

HTML XML

Download as PDF (Size: 77KB) PP. 805-808

DOI: 10.4236/am.2012.37120 3,869 Downloads 6,235 Views Citations

Author(s)

Hao Liang, Junming Xu

Affiliation(s)

Department of Mathematics Southwestern University of Finance and Economics Chengdu 611130, China.
School of Mathematical Sciences University of Science and Technology of China Wentsun Wu Key Laboratory of CASHefei 230026, China.

ABSTRACT

In this note, it is proved that if α≥0.24817, then any digraph on n vertices with minimum outdegree at least αn contains a directed cycle of length at most 5.

KEYWORDS

Digraph; Directed Cycle

Share and Cite:

H. Liang and J. Xu, "A Note on Directed 5-Cycles in Digraphs," Applied Mathematics, Vol. 3 No. 7, 2012, pp. 805-808. doi: 10.4236/am.2012.37120.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.

Free SCIRP Newsletters

Add your e-mail address to receive free newsletters from SCIRP.

Top

Journals Menu

Home

About SCIRP

Service

Policies