Line graphs and the transplantation method

DOI10.1016/J.LAA.2016.05.021zbMATH Open1347.58007arXiv1504.02339OpenAlexW2964079924MaRDI QIDQ306440FDOQ306440

Authors: Peter Herbrich 

Publication date: 31 August 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We study isospectrality for mixed Dirichlet-Neumann boundary conditions, and extend the previously derived graph-theoretic formulation of the transplantation method. Led by the theory of Brownian motion, we introduce vertex-colored and edge-colored line graphs that give rise to block diagonal transplantation matrices. In particular, we rephrase the transplantation method in terms of representations of free semigroups, and provide a method for generating adjacency cospectral weighted directed graphs.

Full work available at URL: https://arxiv.org/abs/1504.02339

Recommendations

• Line graphs and line digraphs
• Tulgeity of line graphs
• Traceability of line graphs
• Path factors and line graphs
• scientific article; zbMATH DE number 5943497
• A note on line graphs
• scientific article; zbMATH DE number 1369943
• Line graph links
• Line graphs of some kind of special graphs
• Line graphs and circulants

zbMATH Keywords

digraphsrepresentation theoryline graphsisospectrality

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Isospectrality (58J53)

Cites Work

• Can One Hear the Shape of a Drum?
• Isospectral Riemann surfaces
• Riemannian coverings and isospectral manifolds
• Isospectral plane domains and surfaces via Riemannian orbifolds
• Isospectral polygons, planar graphs and heat content
• Some planar isospectral domains
• Isospectral graphs with identical nodal counts

This page was built for publication: Line graphs and the transplantation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306440)