Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices
| Autor: | José Luis Palacios, Anna Torriero, Monica Bianchi, Alessandra Cornaro |
|---|---|
| Přispěvatelé: | Bianchi, M, Cornaro, A, Palacios, J, Torriero, A |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
graphs
Index (economics) Applied Mathematics 0211 other engineering and technologies 021107 urban & regional planning arithemtic-geometric index 0102 computer and information sciences 02 engineering and technology Settore SECS-S/06 - METODI MATEMATICI DELL'ECONOMIA E DELLE SCIENZE ATTUARIALI E FINANZIARIE 01 natural sciences Combinatorics 010201 computation theory & mathematics Geometric–arithmetic index Discrete Mathematics and Combinatorics Majorization MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Università Cattolica del Sacro Cuore-IRIS |
| Popis: | Using majorization, we find lower bounds for the geometric–arithmetic index of graphs containing either pendant or fully connected vertices. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|