2 papers
math.CO2021
Equitable partitions for Ramanajun graphs
Mohsen Alinejad, Sanaz Fulad
For d-regular graph G, an edge-signing sigma:E(G) \rightarrow {-1,1} is called a good signing if the absolute eigenvalues of adjacency matrix are at most 2 \sqrt{d-1}. Bilu-Linial…
cs.DM2018
Counting short cycles of (c,d)-regular bipartite graphs
Mohsen Alinejad, Kazem Khashyarmanesh
Recently, working on the Tanner graph which represents a low density parity check (LDPC) code becomes an interesting research subject. Finding the number of short cycles of Tanner…