The strong-connectivity of word-representable digraphs

Details The strong-connectivity of word-representable digraphs The strong-connectivity of word-representable digraphs

2011-02-04

arxiv.org/abs/1102.0980v2

Mathematics

Combinatorics

12 pages, 4 figures

Scientific paper

A word-graph Gw is a digraph represented by a word w such that the vertex-set V(Gw) is the alphabet of w and the edge-set E(Gw) is determined by non-identical adjacent letter pairs in w. In this paper we study the strong-connectivity of word-graphs. Our main result is that the number of strongly connected word-graphs represented by l-words of over an n-alphabet can be expressed via a recurrence relation T(l,n) on the Stirling numbers of the second kind using a link between word partitions and digraph connectivity.

Affiliated with

Also associated with

No associations

Rating

The strong-connectivity of word-representable 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 The strong-connectivity of word-representable digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The strong-connectivity of word-representable digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492064