L'accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l'accord avec les conditions générales d'utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d'une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/
In this article, we focus on structural properties of minimal strong digraphs (MSDs). We carry out a comparative study of properties of MSDs versus (undirected) trees. For some of these properties, we give the matrix version, regarding nearly reducible matrices. We give bounds for the coefficients of the characteristic polynomial corresponding to the adjacency matrix of trees, and we conjecture bounds for MSDs. We also propose two different representations of an MSD in terms of trees (the union of a spanning tree and a directed forest; and a double directed tree whose vertices are given by the contraction of connected Hasse diagrams).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.