ScholarLens Back to search
2022•2nd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2022)Requires access

The spectral radius of the adjacency matrix of a complete binary tree as the number of nodes approaches infinity

Lin Liu

Open publisher page 1 citations

Abstract

Trees are connected graphs without cycles, which are widely used in different fields. One of the hot topics in graph theory is the eigenvalue of graph's adjacency matrix, also known as graph's adjacency spectrum, which is an important research field of graph theory and has a wide range of practical applications. In this paper, we prove that the spectral radius of the adjacency matrix of the complete binary tree is 2√2 when the number of nodes tends to infinity by the eigenvalue of the adjacency matrix of the complete binary tree.

About this research paper

What this paper is about

Trees are connected graphs without cycles, which are widely used in different fields. One of the hot topics in graph theory is the eigenvalue of graph's adjacency matrix, also known as graph's adjacency spectrum, which is an important research field of graph theory and has a wide range of practical applications. In this paper, we prove that the spectral radius of the adjacency matrix of the complete binary tree is 2√2 when the number of nodes tends to infinity by the eigenvalue of the adjacency matrix of the complete binary tree.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Trees are connected graphs without cycles, which are widely used in different fields. One of the hot topics in graph theory is the eigenvalue of graph's adjacency matrix, also known as graph's adjacency spectrum, which is an important research field of graph theory and has a wide range of practical applications. In this paper, we prove that the spectral radius of the adjacency matrix of the complete binary tree is 2√2 when the number of nodes tends to infinity by the eigenvalue of the adjacency matrix of the complete binary tree.

Key concepts: Adjacency matrix, Infinity, Binary tree, Binary number, Spectral radius, Adjacency list, Mathematics, RADIUS

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The spectral radius of the adjacency matrix of a complete binary tree as the number of nodes approaches infinity — Research Paper | ScholarLens