Laplacian Spectrum of Some Special Graphs

In this work, we study Laplacian spectrum of specific graph families constructed by applying join ([Formula: see text]) and direct product (×) operators on the complete graph ([Formula: see text]), complete bipartite graph ([Formula: see text]), hypercube graph ([Formula: see text]) and cycle graph ([Formula: see text]) for some integer [Formula: see text]. In particular, we derive complete Laplacian spectrum of the following graphs explicitly and determine for which [Formula: see text] they can be calculated: (i) [Formula: see text], (ii) [Formula: see text], (iii) [Formula: see text], (iv) [Formula: see text]. We note that the graphs [Formula: see text] are the regular graphs whose Laplacian spectrum are known. By applying graph operations on these graphs, we extend the existing knowledge of Laplacian spectra. Our results suggest that further exploration of the Laplacian spectra of other graph families, using similar graph operations, could yield valuable insights.

Authors

Institutions

Publication Details

Journal
International Journal of Foundations of Computer Science
Published
2025-12-03
DOI
https://doi.org/10.1142/s0129054125500443
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

Laplacian Spectrum of Some Special Graphs

Cahit Dede
International Journal of Foundations of Computer Science
Graph theory and applications
article

Laplacian Spectrum of Some Special Graphs

Cahit Dede
article en

Abstract

In this work, we study Laplacian spectrum of specific graph families constructed by applying join ([Formula: see text]) and direct product (×) operators on the complete graph ([Formula: see text]), complete bipartite graph ([Formula: see text]), hypercube graph ([Formula: see text]) and cycle graph ([Formula: see text]) for some integer [Formula: see text]. In particular, we derive complete Laplacian spectrum of the following graphs explicitly and determine for which [Formula: see text] they can be calculated: (i) [Formula: see text], (ii) [Formula: see text], (iii) [Formula: see text], (iv) [Formula: see text]. We note that the graphs [Formula: see text] are the regular graphs whose Laplacian spectrum are known. By applying graph operations on these graphs, we extend the existing knowledge of Laplacian spectra. Our results suggest that further exploration of the Laplacian spectra of other graph families, using similar graph operations, could yield valuable insights.

International Journal of Foundations of Computer Science
Selçuk University (TR)
Openalex Percentile: Top 57%
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.