On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix

Ali Dehghan 0001, Amir H. Banihashemi. On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. IEEE Transactions on Information Theory, 66(10):6037-6047, 2020. [doi]

@article{DehghanB20a,
  title = {On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix},
  author = {Ali Dehghan 0001 and Amir H. Banihashemi},
  year = {2020},
  doi = {10.1109/TIT.2020.3011556},
  url = {https://doi.org/10.1109/TIT.2020.3011556},
  researchr = {https://researchr.org/publication/DehghanB20a},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {66},
  number = {10},
  pages = {6037-6047},
}