Result: The average connectivity of a digraph
Title:
The average connectivity of a digraph
Authors:
Source:
Discrete applied mathematics. 140(1-3):143-153
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 7 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Connectivité graphe, Graph connectivity, Conectividad grafo, Graphe orienté, Directed graph, Grafo orientado, Informatique théorique, Computer theory, Informática teórica, Tournoi, Tournament, Torneo, Algorithme combinatoire, Combinatorial algorithm, Arbre ordonné
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
School of Mathematics, Statistics, & Information Technology, University of Natal, Private Bag X01, Pietermaritzburg 3209, South Africa
Department of Mathematics and Statistics, The University of Winnipeg, 515 Portage Avenue, Winnipeg, MB R3B 2E9, Canada
Department of Mathematics and Statistics, The University of Winnipeg, 515 Portage Avenue, Winnipeg, MB R3B 2E9, Canada
ISSN:
0166-218X
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.15859785
Database:
PASCAL Archive
Further Information
In this paper we consider the concept of the average connectivity of a digraph D defined to be the average, over all ordered pairs (u, v) of vertices of D, of the maximum number of internally disjoint directed u-v paths. We determine sharp bounds on the average connectivity of orientations of graphs in terms of the number of vertices and edges and for tournaments and orientations of trees in terms of their orders. An efficient procedure for finding the maximum average connectivity among all orientations of a tree is described and it is shown that this maximum is always greater than 2/9 and at most 1/2.