𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generation of isospectral graphs

✍ Scribed by Halbeisen, Lorenz; Hungerb�hler, Norbert

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
357 KB
Volume
31
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss a discrete version of Sunada's Theorem on isospectral manifolds, which allows the generation of isospectral simple graphs, i.e., nonisomorphic simple graphs that have the same Laplace spectrum. We also consider additional boundary conditions and Buser's transplantation technique applied to a discrete situation.

📜 SIMILAR VOLUMES

Generating weakly triangulated graphs
Generating weakly triangulated graphs
✍ Hayward, Ryan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

We show that a graph is weakly triangulated, or weakly chordal, if and only if it can be generated by starting with a graph with no edges, and repeatedly adding an edge, so that the new edge is not the middle edge of any chordless path with four vertices. This is a corollary of results due to Sritha

Fast generation of regular graphs and co
Fast generation of regular graphs and construction of cages
✍ Meringer, Markus 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera

Factorizations of complete multipartite
Factorizations of complete multipartite graphs into generalized cubes
✍ El--Zanati, S.; Vanden Eynden, C. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

For a positive integer d, the usual d-dimensional cube Q d is defined to be the graph (K 2 ) d , the Cartesian product of d copies of K 2 . We define the generalized cube Q(K k , d) to be the graph (K k ) d for positive integers d and k. We investigate the decomposition of the complete multipartite

Generalized eccentricity, radius, and di
Generalized eccentricity, radius, and diameter in graphs
✍ Dankelmann, Peter; Goddard, Wayne; Henning, Michael A.; Swart, Henda C. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

For a vertex v and a (k Ϫ 1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P. Associated with each of these distances, one can define the k-eccentricity of the vertex v as the maximum d