In this paper we determine the complete expression of the lower and upper approximations for the adjacency matrices induced by some basic digraph families. We also introduce a new type of average dependency measure and we provide asymptotic estimates for such a number for cycles, paths and transitive tournaments.
Dependency and Accuracy Measures for Directed Graphs
CHIASELOTTI, Giampiero
;GENTILE, Tommaso;INFUSINO, FEDERICO GIOVANNI;OLIVERIO, Paolo Antonio
2018-01-01
Abstract
In this paper we determine the complete expression of the lower and upper approximations for the adjacency matrices induced by some basic digraph families. We also introduce a new type of average dependency measure and we provide asymptotic estimates for such a number for cycles, paths and transitive tournaments.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DigraphsAMCRev.pdf
accesso aperto
Descrizione: The published article is available at https://www.sciencedirect.com/science/article/abs/pii/S0096300317307300; DOI: 10.1016/j.amc.2017.10.031
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
330.46 kB
Formato
Adobe PDF
|
330.46 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
