activity
20102016
most citedClustering Using Isoperimetric Number of Trees

3 citations · 5 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2016

On the Spectra of Symmetric Cylindrical Constructs

Amir Daneshgar, Ali Taherkhani

In this article, following [A.~Daneshgar, M.~Hejrati, M.~Madani, {\it On cylindrical graph construction and its applications}, EJC, 23(1) p1.29, 45, 2016] we study the spectra of s…

math.CO2015

On the odd girth and the circular chromatic number of generalized Petersen graphs

Amir Daneshgar, Meysam Madani

A class of simple graphs such as is said to be {\it odd-girth-closed} if for any positive integer there exists a graph such that the odd-girth of $G…

math.CO20141 cited

Cylindrical Graph Construction (definition and basic properties)

Amir Daneshgar, Mohsen Hejrati, Meysam Madani

In this article we introduce the {\it cylindrical construction} for graphs and investigate its basic properties. We state a main result claiming a weak tensor-like duality for this…

cs.CV20123 cited

Clustering Using Isoperimetric Number of Trees

Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi

In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show…

cs.CC2010

On Complexity of Isoperimetric Problems on Trees

Amir Daneshgar, Ramin Javadi

This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters c…

math.CO20101 cited

Graph Coloring and Function Simulation

Amir Daneshgar, Ali Reza Rahimi, Siamak Taati

We prove that every partial function with finite domain and range can be effectively simulated through sequential colorings of graphs. Namely, we show that given a finite set $S=\{…