Equitable partitions and spectra of symmetric trees: Revisiting Heilbronner’s composition principle

The notion of equitable partitions, first defined by Horst Sachs, embodies a notable procedure in spectral graph theory, which is far from being conveniently explored in the literature.With equitable partitions, we can deduce significant spectral properties of a graph.For trees with a high level of symmetry, we can combine this technique with the "composition principle" (developed by Edgar Heilbronner more than seven decades ago) and fully determine the entire spectrum.This is a partially survey note where we provide several descriptive examples of this combination.We show that some recent results on the factorization of the characteristic polynomials of symmetric trees can be derived by merging both methods.

Publication Details

Journal
Discrete Mathematics Letters
Published
2024-12-24
DOI
https://doi.org/10.47443/dml.2024.160
Citations
2
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
2.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Equitable partitions and spectra of symmetric trees: Revisiting Heilbronner’s composition principle

2 citations
Discrete Mathematics Letters
Graph theory and applications
2.02
article

Equitable partitions and spectra of symmetric trees: Revisiting Heilbronner’s composition principle

article en
2 citations

Abstract

The notion of equitable partitions, first defined by Horst Sachs, embodies a notable procedure in spectral graph theory, which is far from being conveniently explored in the literature.With equitable partitions, we can deduce significant spectral properties of a graph.For trees with a high level of symmetry, we can combine this technique with the "composition principle" (developed by Edgar Heilbronner more than seven decades ago) and fully determine the entire spectrum.This is a partially survey note where we provide several descriptive examples of this combination.We show that some recent results on the factorization of the characteristic polynomials of symmetric trees can be derived by merging both methods.

Discrete Mathematics LettersVol. 14
Openalex Percentile: Top 12%
Graph theory and applications
2.02
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.