Shangwei Lin
Abstract
Since interconnection networks are often modeled by digraphs,the arc-strong connectivity of a digraph is an important measurement for fault tolerance of networks.In this paper,we present lower bounds on the arc-strong connectivity of a digraph,which are expressed in terms of the degree sequence.
A significance statement is not available in the OpenAlex record.
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.
Since interconnection networks are often modeled by digraphs,the arc-strong connectivity of a digraph is an important measurement for fault tolerance of networks.In this paper,we present lower bounds on the arc-strong connectivity of a digraph,which are expressed in terms of the degree sequence.
Key concepts: Digraph, Arc (geometry), Interconnection, Degree (music), Sequence (biology), Computer science, Combinatorics, Mathematics