Related papers: A new class of reconstructible graphs

In this paper, we give a class of reconstructible graphs.

In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.

In this paper, we show that unswitchable graphs are a proper subclass of split graphs, and exploit this fact to propose efficient algorithms for their recognition and generation.

We propose a general multi-class visual recognition model, termed the Classifier Graph, which aims to generalize and integrate ideas from many of today's successful hierarchical recognition approaches. Our graph-based model has the…

In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…

In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…

In this paper we explore a new method of analysis of associative algebras.

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.

In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…

This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…

We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…

We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…

A new complete invariant for acyclic graphs is presented

In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n,2).