11 citations · 27 across the 20 of their papers we have counts for
6 papers · 2 filters
Upper Bounds on the Automorphism Group of a Graph
Ilia Krasikov, Arie Lev, Bhalchandra D. Thatte
We give upper bounds on the order of the automorphism group of a simple graph
Combinatorics of pedigrees
Bhalchandra D. Thatte
A pedigree is a directed graph in which each vertex (except the founder vertices) has two parents. The main result in this paper is a construction of an infinite family of counter…
Subgraph posets and graph reconstruction
Bhalchandra D. Thatte
We consider 3 (weighted) posets associated with a graph G - the poset P(G) of distinct induced unlabelled subgraphs, the lattice Omega(G) of distinct unlabelled graphs induced by c…
A reconstruction problem related to balance equations-I
Bhalchandra D. Thatte
A modified -deck of a graph is obtained by removing edges in all possible ways and adding (not necessarily new) edges in all possible ways. Krasikov and Roditty used the…
-reconstruction of graphs
Bhalchandra D. Thatte
Let be a group of permutations acting on an -vertex set , and and be two simple graphs on . We say that and are -isomorphic if belongs to the or…
A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies
Bhalchandra D. Thatte
McMorris and Powers proved an Arrow-type theorem on phylogenies given as collections of quartets. There is an error in one of the main lemmas used to prove this theorem. However, t…