نتایج جستجو برای: connected digraphs

تعداد نتایج: 125911  

Journal: :Discrete Applied Mathematics 1995
Francesc Comellas Miguel Angel Fiol

There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...

Journal: :SIAM J. Discrete Math. 2003
Jørgen Bang-Jensen Jing Huang Anders Yeo

We consider the problem (MSSS) of nding a strongly connected spanning subgraph with the minimum number of arcs in a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamil-tonian cycle problem. We show that the problem is polynomially solvable for quasi-transitive digraphs. We describe the minimum number of arcs in such a spanning subgraph of a qu...

Journal: :Networks 2005
Jason I. Brown Xiaohu Li

Given a digraph D, consider the model where each vertex is always operational, but the edges are independently operational with probability p. The strongly connected reliability of D, scRel(D, p), is the probability that the spanning subgraph of D consisting of the operational edges is strongly connected. One can view strongly connected reliability as the probability that any vertex can send in...

2011
MATTHIAS HAMANN FABIAN HUNDERTMARK

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

Journal: :Combinatorica 2011
Erika R. Kovács László A. Végh

We give a constructive characterization for (k, `)-edge-connected digraphs, proving a conjecture of Frank and Szegő.

Journal: :Discrete Mathematics 1999
Victor Neumann-Lara

In this paper we introduce a numerical invariant of digraphs which generalizes that of the number of connected components of a graph. The ao,clic disconnection ~(D) of a digraph D is the minimum number of (weakly) connected components of the subdigraphs obtained from D by deleting an acyclic set of arcs. We state some results about this invariant and compute its value for a variety of circulant...

2012
A. DOLATI Hossein Hajiabolhassan

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with n vertices is spherical in O(n) time.

2007
Guillaume Fertin

Gossiping is a problem of information dissemination described in a group of individuals connected by a communication network, where every individual in the network knows a unique item of information and needs to communicate it to everyone else. This communication pattern nds its main applications in the eld of interconnection networks for parallel and distributed architecture. Previous papers h...

Journal: :Applicable Analysis and Discrete Mathematics 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید