research
∙
01/31/2021
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard
The simplicial rook graph 𝒮ℛ(m,n) is the graph whose vertices are vector...
share
research
∙
05/31/2019
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 ...
research
∙
05/08/2019
On the semi-proper orientations of graphs
A semi-proper orientation of a given graph G is a function (D,w) that a...
research
∙
03/20/2019
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...
research
∙
06/04/2018
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...
research
∙
06/04/2018
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...
research
∙
01/25/2018
On the algorithmic complexity of decomposing graphs into regular/irregular structures
A locally irregular graph is a graph whose adjacent vertices have distin...
research
∙
01/13/2018
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
A Not-All-Equal (NAE) decomposition of a graph G is a decomposition of t...
research
∙
11/28/2017
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...
research
∙
11/28/2017