8 papers
On the In-Out-Proper Orientations of Graphs
Ali Dehghan
An orientation of a graph is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree mi…
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
The simplicial rook graph is the graph whose vertices are vectors in such that for each vector the summation of its coordinates is and…
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles
Ali Dehghan, Amir H. Banihashemi
Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) code…
On the semi-proper orientations of graphs
Ali Dehghan
A {\it semi-proper orientation} of a given graph is a function that assigns an orientation and a positive integer weight to each edge such that for e…
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
Ali Dehghan, Amir H. Banihashemi
Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are…
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
Ali Dehghan, Amir H. Banihashemi
Counting short cycles in bipartite graphs is a fundamental problem of interest in the analysis and design of low-density parity-check (LDPC) codes. The vast majority of research in…