The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k-Ary Tree

We give the explicit formula for the characteristic polynomial of the Laplacian matrix of every rooted balanced [Formula: see text]-ary tree of depth [Formula: see text].

Authors

Zoran Stanić (ORCID: https://orcid.org/0000-0002-4949-4203)

Institutions

University of Belgrade (RS)

Publication Details

Journal: Algebra Colloquium
Published: 2025-03-01
DOI: https://doi.org/10.1142/s1005386725000045
Primary Topic: Graph theory and applications
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k-Ary Tree

Zoran Stanić

Mar 1, 2025

Algebra Colloquium

Graph theory and applications

article

The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k-Ary Tree

Zoran Stanić

March 1, 2025article en

Abstract

We give the explicit formula for the characteristic polynomial of the Laplacian matrix of every rooted balanced [Formula: see text]-ary tree of depth [Formula: see text].

Algebra ColloquiumVol. 32(01)

University of Belgrade (RS)

Openalex Percentile: Top 92%

Graph theory and applications

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k-Ary Tree — Zoran Stanić · Algebra Colloquium (2025) | TGRS Research Map | TGRS