
On the maximum number of non attacking rooks on a highdimensional simplicial chessboard
The simplicial rook graph 𝒮ℛ(m,n) is the graph whose vertices are vector...
read it

Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles
Finding the multiplicity of cycles in bipartite graphs is a fundamental ...
read it

On the semiproper orientations of graphs
A semiproper orientation of a given graph G is a function (D,w) that a...
read it

On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
Counting short cycles in bipartite graphs is a fundamental problem of in...
read it

On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
Counting short cycles in bipartite graphs is a fundamental problem of in...
read it

On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
Counting short cycles in bipartite graphs is a fundamental problem of in...
read it

On the algorithmic complexity of decomposing graphs into regular/irregular structures
A locally irregular graph is a graph whose adjacent vertices have distin...
read it

NotAllEqual and 1inDegree Decompositions: Algorithmic Complexity and Applications
A NotAllEqual (NAE) decomposition of a graph G is a decomposition of t...
read it

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
Leafless elementary trapping sets (LETSs) are known to be the problemati...
read it

From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
Cages, defined as regular graphs with minimum number of nodes for a give...
read it
Ali Dehghan
is this you? claim profile