1 citations · 2 across the 8 of their papers we have counts for
6 papers · 1 filter
A Simple Algorithm for a Computationally Hard Problem
Ameneh Farhadian
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomo…
Almost every -vertex graph is determined by its -vertex subgraphs
Ameneh Farhadian
The paper shows that almost every -vertex graph is such that the multiset of its induced subgraphs on vertices is sufficient to determine it up to isomorphism. The…
A Simple Explanation for the Reconstruction of Graphs
Ameneh Farhadian
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this pr…
A Coordinate System for Graphs
Ameneh Farhadian
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph o…
Discrimination of Graph Isomorphism Classes by Continuous Spectrum and Split Technique
Ameneh Farhadian
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-iso…
Reconstruction of graphs via asymmetry
Ameneh Farhadian
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called su…