ScholarLens Back to search
2009•Journal of Chongqing Institute of TechnologyRequires access

The Number of Directed Cycles in a Directed Graph Based on the Arc Determinant

Ting Xie

Open publisher page 0 citations

Abstract

This paper uses arc determinant to discuss the directed cycle,then gets the number of directed cycles in n-order directed graph and strictly simply-connected graph,as well as the upper bound of directed cycles in a Hamilton graph.

About this research paper

What this paper is about

This paper uses arc determinant to discuss the directed cycle,then gets the number of directed cycles in n-order directed graph and strictly simply-connected graph,as well as the upper bound of directed cycles in a Hamilton graph.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper uses arc determinant to discuss the directed cycle,then gets the number of directed cycles in n-order directed graph and strictly simply-connected graph,as well as the upper bound of directed cycles in a Hamilton graph.

Key concepts: Directed graph, Feedback arc set, Combinatorics, Graph, Arc (geometry), Mathematics, Strongly connected component, Null graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Number of Directed Cycles in a Directed Graph Based on the Arc Determinant — Research Paper | ScholarLens