Number of cycles of small length in a graph

References

• Alon, N., Yuster, R., Zwick, U. (1997). Finding and counting given length cycles. Algorithmica 17: 209–223.
   Web of Science ®Google Scholar
• Bax, E. T. (1994). Algorithms to count paths and cycles. Inf. Process. Lett. 52(5): 249–252.
   Web of Science ®Google Scholar
• Bjorklund, A., Husfeldt, T., Kaski, P., Koivisto, M. (2009). Counting paths and packing in halves. Lect. Notes Comput. Sci. 5757: 578–586.
   Google Scholar
• Blake, I. F., Lin, S. (2018). On short cycle enumeration in biregular bipartite graphs. IEEE Trans. Inf. Theory. 64(10): 6526–6535.
   Web of Science ®Google Scholar
• Boxwala, S. A., Movarraei, N. (2015). On the number of paths of length 5 in a graph. Int. J. Appl. Math. Res. 4(1): 30–51.
   Google Scholar
• Boxwala, S. A., Movarraei, N. (2015). On the number of paths of length 6 in a graph. Int. J. Appl. Math. Res. 4(2): 267–280.
   Google Scholar
• Chang, Y. C., Fu, H. L. (2003). The number of 6-cycles in a graph. Bull. Inst. Combin. Appl. 39: 27–30.
   Google Scholar
• Cvetković, D., Doob, M., Sachs, H. (1980). Spectra of Graphs: Theory and Application. New York, NY: Academic Press.
   Google Scholar
• Cvetković, D., Petrić, M. (1984). A table of connected graphs on six vertices. Discrete Math. 50: 37–49.
   Web of Science ®Google Scholar
• Dehghan, A., Banihashemi, A. H. (2019). On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph. IEEE Trans. Inf. Theory. 65(6): 3778–3789.
   Web of Science ®Google Scholar
• Giscard, P.-L., Kriege, N., Wilson, R. C. (2019). A general purpose algorithm for counting simple cycles and simple paths of any length. Algorithmica. 81: 2716–2737.
   Web of Science ®Google Scholar
• Halford, T. R., Chugg, K. M. (2006). An algorithm for counting short cycles in bipartite graphs. IEEE Trans. Inf. Theory. 52(1): 287–292.
   Web of Science ®Google Scholar
• Harary, F., Manvel, B. (1971). On the number of cycles in a graph. Matematický Časopis. 21(1): 55–63.
   Google Scholar
• Karimi, M., Banihashemi, A. H. (2012). Counting short cycles of quasi cyclic photograph LDPC codes. IEEE Commun. Lett. 16(3): 400–403.
   Web of Science ®Google Scholar
• Karimi, M., Banihashemi, A. H. (2013). Message-passing algorithms for counting short cycles in a graph. IEEE Trans. Commun. 61(2): 485–495.
   Web of Science ®Google Scholar
• Karimi, M., Banihashemi, A. H. (2013). On the girth of quasi-cyclic photograph LDPC codes. IEEE Trans. Inf. Theory. 59(7): 4542–4552.
   Web of Science ®Google Scholar
• Koutis, I. (2008). Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M. M., Ingólfsdóttir, A., Walukiewicz, I., eds. Automata, Languages and Programming. ICALP 2008. Heidelberg, Berlin: Springer, pp. 575–586.
   Google Scholar
• Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K. (2014). Algebraic quasi-cyclic LDPC codes: construction, low error-floor, large girth and a reduced-complexity decoding scheme. IEEE Trans. Commun. 62(8): 2626–2637.
   Web of Science ®Google Scholar
• Li, J., Lin, S., Abdel-Ghaffar, K. (2015). Improved message-passing algorithm for counting short cycles in bipartite graphs. In: Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 416–420.
   Google Scholar
• Mao, Y., Banihashemi, A. H. (2001). A heuristic search for good low-density parity-check codes at short block lengths. ICC 2001: IEEE Int. Conf. Commun. 1: 41–44.
   Google Scholar
• Movarraei, N., Boxwala, S. A. (2016). On the number of cycles in a graph. Open J. Discrete Math. 6(2): 41–69.
   Google Scholar
• Movarraei, N., Shikare, M. M. (2014). On the number of paths of lengths 3 and 4 in a graph. Int. J. Appl. Math. Res. 3(2): 178–189.
   Google Scholar
• Williams, R. (2009). Finding a path of length k in O*(2k) time. Inf. Process. Lett. 109(6): 315–318.
   Web of Science ®Google Scholar
• Xiao, H., Banihashemi, A. H. (2009). Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration. IEEE Trans. Commun. 57(6): 1550–1555.
   Web of Science ®Google Scholar