Laplacian Spectra and von Neumann Entropy of Generalized Splitting and Shadow-Splitting Graphs

Graph operations provide a setting in which structural changes can be related to spectral invariants.We study the two-parameter generalized splitting graphs S p,q (G) and shadow-splitting graphs H p,q (G).Our main result is an orthogonal reduction of their Laplacian matrices, valid for arbitrary connected base graphs, into repeated blocks and a coupled block of order 2|V (G)|.For a connected regular base graph, this reduction yields the complete Laplacian spectra, with all multiplicity contributions specified.The corresponding von Neumann entropy formulae follow directly from these spectra and the edge counts.The case p = 1 recovers the known one-parameter splitting setting; our contribution lies in the common Laplacian reduction and its two-parameter spectral consequences.We also provide examples that illustrate the case p = 1 and verify the spectral and entropy formulae for both constructions based on the cycle of order four.

Authors

Institutions

Publication Details

Journal
Electronic Journal of Mathematics
Published
2026-11-14
DOI
https://doi.org/10.47443/ejm.2026.058
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Laplacian Spectra and von Neumann Entropy of Generalized Splitting and Shadow-Splitting Graphs

Zhen Lin, Jiajia Wang
1 links
Electronic Journal of Mathematics
Graph theory and applications
article

Laplacian Spectra and von Neumann Entropy of Generalized Splitting and Shadow-Splitting Graphs

Zhen Lin, Jiajia Wang
article en

Abstract

Graph operations provide a setting in which structural changes can be related to spectral invariants.We study the two-parameter generalized splitting graphs S p,q (G) and shadow-splitting graphs H p,q (G).Our main result is an orthogonal reduction of their Laplacian matrices, valid for arbitrary connected base graphs, into repeated blocks and a coupled block of order 2|V (G)|.For a connected regular base graph, this reduction yields the complete Laplacian spectra, with all multiplicity contributions specified.The corresponding von Neumann entropy formulae follow directly from these spectra and the edge counts.The case p = 1 recovers the known one-parameter splitting setting; our contribution lies in the common Laplacian reduction and its two-parameter spectral consequences.We also provide examples that illustrate the case p = 1 and verify the spectral and entropy formulae for both constructions based on the cycle of order four.

Electronic Journal of MathematicsVol. 12
Qinghai Normal University (CN)
National Natural Science Foundation of China
Graph theory and applications
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.

Laika access coming soon