Laplacian Coefficients of a Forest in Terms of the Number of Closed Walks in the Forest and its Line Graph
In this paper, we deal with calculating the laplacian coefficients of a finite simple graph $G$ with the Laplacian polynomial $\psi(G,\lambda) = \sum_{k=0}^{n}(-1)^{n-k}c_k\lambda^k$. We also explore the relationship between the number of closed walks in a graph and a series of its line graphs...
Saved in:
| Main Authors: | Ali Ghalavand, Alireza Ashrafi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2025-06-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_114890_4086ca2b1bbd37b77e9cca3d4e7d2f73.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
by: Shridhar Chandrakant Patekar, et al.
Published: (2018-01-01) -
A Note on the Laplacian Energy of the Power Graph of a Finite Cyclic Group
by: Şerife Büyükköse, et al.
Published: (2024-04-01) -
On the neighbourhood degree sum-based Laplacian energy of graphs
Published: (2025-01-01) -
Laplacian Controllability and Observability of Multi-Agent Systems: Recent Advances in Tree Graphs
by: Gianfranco Parlangeli
Published: (2025-04-01) -
ForestSemantic: a dataset for semantic learning of forest from close-range sensing
by: Xinlian Liang, et al.
Published: (2025-01-01)