Jia Ren
Abstract
The connectedness of digraph is discussed by using matrix approach. The matrix approaches to calculate the directed cycles of the digraph are expounded. The necessary and sufficient conditions for a digraph to be a Hamilton graph are obtained. Finally,an example is presented.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The connectedness of digraph is discussed by using matrix approach. The matrix approaches to calculate the directed cycles of the digraph are expounded. The necessary and sufficient conditions for a digraph to be a Hamilton graph are obtained. Finally,an example is presented.
Key concepts: Digraph, Social connectedness, Directed graph, Mathematics, Matrix (chemical analysis), Combinatorics, Graph, Discrete mathematics