Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Anna Torriero"'
Publikováno v:
Journal of Business Research. 129:774-783
Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describes a tendency for nodes to be connected to others with a similar degree. A generalization of the assortativity index has been proposed in the literatu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::344e2a3dad64e6e845566bdd71fe7f34
https://doi.org/10.1016/j.jbusres.2019.10.008
https://doi.org/10.1016/j.jbusres.2019.10.008
Publikováno v:
Discrete Applied Mathematics. 255:142-154
The resistance indices, namely the Kirchhoff index and its generalisations, have undergone intense critical scrutiny in recent years. Based on random walks, we derive three Kirchhoffian indices for strongly connected and weighted digraphs. These indi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93b99f85d2d3ab96f2595a5241a674fa
https://doi.org/10.1016/j.dam.2018.08.024
https://doi.org/10.1016/j.dam.2018.08.024
Economists have been aware of the mapping between an Input-Output (I-O, hereinafter) table and the adjacency matrix of a weighted digraph for several decades (Solow, Econometrica 20(1):29–46, 1952). An I-O table may be interpreted as a network in w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c33d6a45616d2935ac86ee819f2b2fdf
http://hdl.handle.net/10807/183309
http://hdl.handle.net/10807/183309
Publikováno v:
Università Cattolica del Sacro Cuore-IRIS
Using majorization, we find lower bounds for the geometric–arithmetic index of graphs containing either pendant or fully connected vertices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3f5781ed438790263197987951de0ed
http://hdl.handle.net/10281/334778
http://hdl.handle.net/10281/334778
Brokerage is crucial for dark networks. In analyzing communications among criminals, which naturally induce bipartite networks, previous studies have focused on the classic Freeman's betweenness, conceived for one-mode matrices and possibly biasing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212a28bb6b705552f68d76d4a381d9df
http://hdl.handle.net/10807/130520
http://hdl.handle.net/10807/130520
Assortativity was first introduced by Newman and has been extensively studied and applied to many real world networked systems since then. Assortativity is a graph metrics and describes the tendency of high degree nodes to be directly connected to hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c814470137ca0838e95b3cfaafae3baf
http://hdl.handle.net/10807/97962
http://hdl.handle.net/10807/97962
We introduce the mixed degree-Kirchhoff index, a new molecular descriptor defined by $$\widehat{R}(G)=\sum_{i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fcdb056067c77e5c35846740f9b7ea1
http://hdl.handle.net/10807/90676
http://hdl.handle.net/10807/90676
Publikováno v:
The Journal of Mathematical Sociology. 31:237-248
In this article we establish new results on the components of the principal eigenvector in an undirected graph. Those results are particularly significant in relation to the concept of centrality in social networks. In particular degree centrality an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd90d8b0c608fcd34e444471ce395152
https://doi.org/10.1080/00222500701373251
https://doi.org/10.1080/00222500701373251
In this paper we define a new graph-theoretic cyclicity index CW(G) as a natural generalization of the global cyclicity index C(G) when arbitrary resistances are allocated to each edge of an electrical network. Upper and lower bounds for CW(G) are th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b8888080cbd96148a280ad197fe4656
http://hdl.handle.net/10281/334772
http://hdl.handle.net/10281/334772
Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first multiplicativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e02dc4f4234252703eb2e1dd865a5ed
http://hdl.handle.net/10807/61184
http://hdl.handle.net/10807/61184