Minimal strong digraphs

Details Minimal strong digraphs Minimal strong digraphs

2010-04-27

arxiv.org/abs/1004.4827v1

Mathematics

Combinatorics

Scientific paper

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove that every minimal strong digraph of order $n\geq 2$ is the expansion of a minimal strong digraph of order $n-1$ and we give sequentially generative procedures for the constructive characterization of the classes of minimal strong digraphs. Finally we describe algorithms to compute unlabeled minimal strong digraphs and their isospectral classes.

Affiliated with

Also associated with

No associations

Rating

Minimal strong digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal strong digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal strong digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-237446