About weak connectivity

DOI10.1016/S0012-365X(96)00203-8MaRDI QIDQ1356780zbMATH OpenOpenAlexWikidataFDO

Authors Pascal Préa

Publication date 26 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00203-8

zbMATH Keywords

connectivitydigraphstournamentweakly connected components

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Review text

A tournament is an orientation of a complete graph. A local tournament is an oriented graph \(D=(V,A)\) (i.e. without 2-cycles) with the property that for every vertex \(x\in V\) the set of out-neighbours as well as the set of in-neighbours of \(x\) induce a tournament. The theme of this paper are those digraphs such that for every induced subgraph, one can define (disjoint) weakly connected components. When oriented and finite these are exactly the local tournaments. The structure of these graphs when infinite and locally infinite is given in this paper. Finally it is shown that the general case (where 2-cycles are allowed) can be reduced to the oriented case by contraction of 2-cycles.

Recommendations

• Cycle factors in strongly connected local tournaments
• Completely strong path-connectivity of local tournaments
• scientific article; zbMATH DE number 1287859
• Weakly Hamiltonian-connected locally semicomplete digraphs

Cites work

• Graphs and topologies on discrete sets
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Locally semicomplete digraphs: A generalization of tournaments

Cited in

(3)

• Preference graph of potential method as a fuzzy graph
• Connectivity of local tournaments
• The competition graph of a connected nonstrong local tournament

This page was built for publication: About weak connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356780)