Laplacian of a graph covering and its applications
DOI10.1007/s40840-018-0617-xzbMath1419.05128OpenAlexW2793202252WikidataQ130151553 ScholiaQ130151553MaRDI QIDQ2272644
Publication date: 20 September 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-018-0617-x
complexityLaplacian matrixgraph coveringresistance distanceKirchhoff indexnormalized Laplacian matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resistance distances and Kirchhoff index of graphs with an involution
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- Characteristic polynomials of ramified uniform covering digraphs
- Resistance distance and the normalized Laplacian spectrum
- Signed graphs
- Generating all graph coverings by permutation voltage assignments
- Characteristic polynomials of some graph coverings
- Zeta functions of finite graphs and coverings
- Resistance distances and the Kirchhoff index in double graphs
- On the notion of balance of a signed graph
- Caracteristics polynomials of some grap bundlesII
- Characteristic polynomials of graph coverings
- On the Laplacian Eigenvalues of Signed Graphs
- Graphs and matrices
This page was built for publication: Laplacian of a graph covering and its applications