activity
20112016
most citedHigher order assortativity in complex networks

28 citations · 79 across the 6 of their papers we have counts for

collaborators

6 papers

physics.soc-ph2016★ 28 cited

Higher order assortativity in complex networks

Alberto Arcagni, Rosanna Grassi, Silvana Stefani +1

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 desc…

q-fin.GN2014★ 2 cited

A Multiple Network Approach to Corporate Governance

Fausto Bonacina, Marco D'Errico, Enrico Moretto +2

In this work, we consider Corporate Governance (CG) ties among companies from a multiple network perspective. Such a structure naturally arises from the close interrelation between…

math.CO2013★ 12 cited

New bounds of degree-based topological indices for some classes of -cyclic graphs

Monica Bianchi, Alessandra Cornaro, José Luis Palacios +1

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 verti…

math.CO2013★ 14 cited

New upper and lower bounds for the additive degree-Kirchhoff index

Monica Bianchi, Alessandra Cornaro, José Luis Palacios +1

Given a simple connected graph on vertices with size and degree sequence , the aim of this paper is to exhibit new upper and lower boun…

math.CO2011★ 21 cited

A majorization method for localizing graph topological indices

Alessandra Cornaro, Monica Bianchi, Anna Torriero

This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and n…

math.CO2011★ 2 cited

Majorization under constraints and bounds of the second Zagreb index

Monica Bianchi, Alessandra Cornaro, Anna Torriero

In this paper we present a theoretical analysis in order to establish maximal and minimal vectors with respect to the majorization order of particular subsets of \Re ^n: Afterwards…