11 citations · 27 across the 20 of their papers we have counts for
15 papers · 1 filter
A refinement of Kelly's lemma for graph reconstruction for counting rooted subgraphs
Deisiane Lopes Gonçalves, Bhalchandra D. Thatte
Kelly's lemma is a basic result on graph reconstruction. It states that given the deck of a graph on vertices, and a graph on fewer than vertices, we can count the…
On the class reconstruction number of trees
Ilia Krasikov, Yehuda Roditty, Bhalchandra D. Thatte
Harary and Lauri conjectured that the class reconstruction number of trees is 2, that is, each tree has two unlabelled vertex-deleted subtrees that are not both in the deck of any…
On the Boolean dimension of a graph and other related parameters
Maurice Pouzet, Hamza Si Kaddour, Bhalchandra D. Thatte
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exa…
A construction of the abstract induced subgraph poset of a graph from its abstract edge subgraph poset
Deisiane Lopes Gonçalves, Bhalchandra D. Thatte
The abstract induced subgraph poset of a graph is the isomorphism class of the induced subgraph poset of the graph, suitably weighted by subgraph counting numbers. The abstract bon…
An algebraic formulation of the graph reconstruction conjecture
Igor C. Oliveira, Bhalchandra D. Thatte
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its v…
The maximum agreement subtree problem
Daniel M. Martin, Bhalchandra D. Thatte
In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees and , both with leaf-set , we are interested in the size…