Distance spectral radius of series-reduced trees with parameters
| Autor: | Hongying Lin, Yuyuan Deng, Dangui Li, Bo Zhou |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Degree (graph theory)
Spectral radius 0211 other engineering and technologies 021107 urban & regional planning 010103 numerical & computational mathematics 02 engineering and technology Management Science and Operations Research 01 natural sciences Tree (graph theory) Computer Science Applications Theoretical Computer Science Vertex (geometry) Combinatorics Matrix (mathematics) Distance matrix 0101 mathematics Eigenvalues and eigenvectors Connectivity Mathematics |
| Zdroj: | RAIRO - Operations Research. 55:S2561-S2574 |
| ISSN: | 1290-3868 0399-0559 |
| Popis: | For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G. A series-reduced tree is a tree with at least one internal vertex and all internal vertices having degree at least three. Those series-reduced trees that maximize the distance spectral radius are determined over all series-reduced trees with fixed order and maximum degree and over all series-reduced trees with fixed order and number of leaves, respectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|