Constructing Non-isomorphic Signless Laplacian Cospectral Graphs

08/13/2018
by   Supriyo Dutta, et al.
0

In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than 70% of non-isomorphic signless-Laplacian cospectral graphs can be generated with partial transpose when number of vertices is < 8. We have also produced numerous examples of non-isomorphic signless Laplacian cospectral graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

Integer Laplacian Eigenvalues of Chordal Graphs

In this paper, structural properties of chordal graphs are analysed, in ...
research
07/13/2020

Integer Laplacian eigenvalues of strictly chordal graphs

In this paper, we establish the relation between classic invariants of g...
research
04/13/2018

Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization

This article describes an implementation of a nonparametric Bayesian app...
research
10/17/2020

Continuum limit of p-Laplacian evolution problems on graphs:L^q graphons and sparse graphs

In this paper we study continuum limits of the discretized p-Laplacian e...
research
01/28/2022

Multiscale Graph Comparison via the Embedded Laplacian Distance

We introduce a simple and fast method for comparing graphs of different ...
research
01/08/2019

On Laplacian spectrum of dendrite trees

For dendrite graphs from biological experiments on mouse's retinal gangl...
research
04/25/2018

On the Dual Geometry of Laplacian Eigenfunctions

We discuss the geometry of Laplacian eigenfunctions -Δϕ = λϕ on compact ...

Please sign up or login with your details

Forgot password? Click here to reset