Dariush Kiani

Orcid: 0000-0003-4574-4380

Affiliations:
  • Amirkabir University of Technology, Iran


According to our database1, Dariush Kiani authored at least 19 papers between 2010 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A proof for a conjecture on the regularity of binomial edge ideals.
J. Comb. Theory, Ser. A, 2021

2019
The lattice of subracks is atomic.
J. Comb. Theory, Ser. A, 2019

Spanning Eulerian Subgraphs of Large Size.
Graphs Comb., 2019

Edge-connectivity and edges of even factors of graphs.
Discuss. Math. Graph Theory, 2019

Structure of Trees with Respect to Nodal Vertex Sets.
CoRR, 2019

2017
Construction and Encoding of QC-LDPC Codes Using Group Rings.
IEEE Trans. Inf. Theory, 2017

LDPC Lattice Codes for Full-Duplex Relay Channels.
IEEE Trans. Commun., 2017

Some Posets Of Unicyclic Graphs Based On Signless Laplacian Coefficients.
Ars Comb., 2017

Existence of equitable h-edge-colorings of type s = 2, 3 of K<sub>t</sub>.
Ars Comb., 2017

2016
The Castelnuovo-Mumford regularity of binomial edge ideals.
J. Comb. Theory, Ser. A, 2016

2015
An Algebraic Criterion for the Choosability of Graphs.
Graphs Comb., 2015

High-rate space-time block codes from twisted Laurent series rings.
Adv. Math. Commun., 2015

One-level LDPC lattice codes for the relay channels.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015

2014
Graphs whose Spectrum Determined by Non-constant Coefficients.
Electron. Notes Discret. Math., 2014

2013
On The Binomial Edge Ideal of a Pair of Graphs.
Electron. J. Comb., 2013

Characterization of M<sub>3</sub>(2)-graphs.
Ars Comb., 2013

2012
Binomial Edge Ideals of Graphs.
Electron. J. Comb., 2012

On the Unitary Cayley Graph of a Ring.
Electron. J. Comb., 2012

2010
Erratum to "The lollipop graph is determined by its Q-spectrum".
Discret. Math., 2010


  Loading...