IRIS PubliCatt
PubliCatt è il repository istituzionale ad accesso aperto dell'Università Cattolica del Sacro Cuore, dove gli utenti autorizzati afferenti all'Ateneo provvedono direttamente e autonomamente a depositare e a rendere visibili le proprie pubblicazioni, inserendo i dati descrittivi del documento stesso ("metadati", quali il titolo, autore, abstract, etc.) e, laddove possibile, il testo della pubblicazione stessa (full-text).
PubliCatt utilizza la piattaforma IRIS (Institutional Research Information System) sviluppata da CINECA.
EnglishIn this article, we investigate several issues related to the use of the index S(G), known as the Zagreb index (see Gutman and Das, 2004) or “S-metric” (Alderson and Li, 2007). We present some new upper and lower bounds for S(G), in terms of the degree sequence of G. Then, we concentrate on trees and prove that in trees with maximum S(G) the eigenvector ordering is coherent with the degree ordering; that is, degree central vertices are also eigenvector central. This confirms results given in Bonacich (2007). Further, we show that these trees have minimum diameter and maximum spectral radius in the set of trees with a given degree sequence. A simple application to a company organizational network is provided.
Torriero, A., Stefani, S., Grassi, R., Extremal properties of graphs and eigencentrality in trees with a given degree sequence, <<THE JOURNAL OF MATHEMATICAL SOCIOLOGY>>, 2010; 34 (2): 115-135. [doi:10.1080/00222500903221563] [http://hdl.handle.net/10807/14023]
| Autori: | ||
| Titolo: | Extremal properties of graphs and eigencentrality in trees with a given degree sequence | |
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1080/00222500903221563 | |
| Data di pubblicazione: | 2010 | |
| Abstract: | In this article, we investigate several issues related to the use of the index S(G), known as the Zagreb index (see Gutman and Das, 2004) or “S-metric” (Alderson and Li, 2007). We present some new upper and lower bounds for S(G), in terms of the degree sequence of G. Then, we concentrate on trees and prove that in trees with maximum S(G) the eigenvector ordering is coherent with the degree ordering; that is, degree central vertices are also eigenvector central. This confirms results given in Bonacich (2007). Further, we show that these trees have minimum diameter and maximum spectral radius in the set of trees with a given degree sequence. A simple application to a company organizational network is provided. | |
| Lingua: | Inglese | |
| Rivista: | ||
| Citazione: | Torriero, A., Stefani, S., Grassi, R., Extremal properties of graphs and eigencentrality in trees with a given degree sequence, <<THE JOURNAL OF MATHEMATICAL SOCIOLOGY>>, 2010; 34 (2): 115-135. [doi:10.1080/00222500903221563] [http://hdl.handle.net/10807/14023] | |
| Appare nelle tipologie: | Articolo in rivista, Nota a sentenza |
File in questo prodotto:
http://hdl.handle.net/10807/14023
Copyright © 2021