Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
View through CrossRef
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs. We extend the list of graph classes for which the conjecture holds. We give a proof that bipartite permutation graphs are reconstructible.
World Scientific Pub Co Pte Lt
Title: BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
Description:
The graph reconstruction conjecture is a long-standing open problem in graph theory.
The conjecture has been verified for all graphs with at most 11 vertices.
Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs.
We extend the list of graph classes for which the conjecture holds.
We give a proof that bipartite permutation graphs are reconstructible.
Related Results
Neighborhood Reconstruction and Cancellation of Graphs
Neighborhood Reconstruction and Cancellation of Graphs
We connect two seemingly unrelated problems in graph theory.Any graph $G$ has a neighborhood multiset $\mathscr{N}(G)= \{N(x) \mid x\in V(G)\}$ whose elements are precisely the ope...
Complete (2,2) Bipartite Graphs
Complete (2,2) Bipartite Graphs
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an...
Fidelity and entanglement of random bipartite pure states: insights and applications
Fidelity and entanglement of random bipartite pure states: insights and applications
Abstract
We investigate the fidelity of Haar random bipartite pure states from a fixed reference quantum state and their bipartite entanglement. By plotting the fide...
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
Abstract
To improve the image transmission security, an image encryption algorithm based on double permutation with random diffusion is proposed in this paper. This algorit...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices
Bipartite Graphs Related to Mutually Disjoint S-Permutation Matrices
Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general case are discussed in this pap...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...