On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

DOI10.1109/TIT.2019.2895356zbMath1432.05052arXiv1806.01433OpenAlexW2962845578MaRDI QIDQ5224033

Ali Dehghan, Amir H. Banihashemi

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.01433

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Related Items (4)

Number of cycles of small length in a graph ⋮ Global eigenvalue fluctuations of random biregular bipartite graphs ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles ⋮ Counting short cycles of (c,d)-regular bipartite graphs

This page was built for publication: On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph