Construction of cospectral graphs

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

Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a clustered graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2020

On the flip graphs on perfect matchings of complete graphs and signed reversal graphs

In this paper, we study the flip graph on the perfect matchings of a com...
research
07/09/2019

Open problems in the spectral theory of signed graphs

Signed graphs are graphs whose edges get a sign +1 or -1 (the signature)...
research
07/10/2015

A Hybrid Graph-drawing Algorithm for Large, Naturally-clustered, Disconnected Graphs

In this paper, we present a hybrid graph-drawing algorithm (GDA) for lay...
research
09/21/2018

Constructing Hard Examples for Graph Isomorphism

We describe a method for generating graphs that provide difficult exampl...
research
07/15/2023

On the Possibility of a Connection between the Construction of a Class of Bigeodetic Blocks and the Existence Problem for Biplanes

Graph theory and enumerative combinatorics are two branches of mathemati...
research
09/11/2019

Algebraic Property Graphs

In this paper, we use algebraic data types to define a formal basis for ...
research
06/22/2019

Mumford-Shah functionals on graphs and their asymptotics

We consider adaptations of the Mumford-Shah functional to graphs. These ...

Please sign up or login with your details

Forgot password? Click here to reset