Spanning trees in directed square cycles

We classify weakly connected spanning closed (WCSC) subgraphs of C n 2 ⃗ , the square of a directed n -vertex cycle. Then we show that every spanning tree of C n 2 ⃗ is contained in a unique nontrivial WCSC subgraph of C n 2 ⃗ . As a result, we obtain a purely combinatorial derivation of the formula for the number of directed spanning trees of C n 2 ⃗ . Moreover, we obtain the formula for the number of directed spanning trees of C n 2 ⃗ , which is a Jacobsthal number.

Authors

Institutions

Publication Details

Journal
Discrete Applied Mathematics
Published
2025-10-09
DOI
https://doi.org/10.1016/j.dam.2025.10.005
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spanning trees in directed square cycles

Yuuho Tanaka
Discrete Applied Mathematics
Advanced Graph Theory Research
article

Spanning trees in directed square cycles

Yuuho Tanaka
article en

Abstract

We classify weakly connected spanning closed (WCSC) subgraphs of C n 2 ⃗ , the square of a directed n -vertex cycle. Then we show that every spanning tree of C n 2 ⃗ is contained in a unique nontrivial WCSC subgraph of C n 2 ⃗ . As a result, we obtain a purely combinatorial derivation of the formula for the number of directed spanning trees of C n 2 ⃗ . Moreover, we obtain the formula for the number of directed spanning trees of C n 2 ⃗ , which is a Jacobsthal number.

Discrete Applied MathematicsVol. 379
Oita University (JP)
Openalex Percentile: Top 70%
Advanced Graph Theory Research
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.

Spanning trees in directed square cycles — Yuuho Tanaka · Discrete Applied Mathematics (2025) | TGRS Research Map | TGRS