Modabish, A. Et Al. 2022. Enumeration of spanning trees in a chain of diphenylene graphs. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY , vol.25, no.1 , 241-251.

Modabish, A., Husin, M. N., Alameri, A. Q., Ahmed, H., Alaeiyan, M., Farahani, M. R., ... Cancan, M.(2022). Enumeration of spanning trees in a chain of diphenylene graphs. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY , vol.25, no.1, 241-251.

Modabish, Abdulhafid Et Al. "Enumeration of spanning trees in a chain of diphenylene graphs," JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY , vol.25, no.1, 241-251, 2022

Modabish, Abdulhafid Et Al. "Enumeration of spanning trees in a chain of diphenylene graphs." JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY , vol.25, no.1, pp.241-251, 2022

Modabish, A. Et Al. (2022) . "Enumeration of spanning trees in a chain of diphenylene graphs." JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY , vol.25, no.1, pp.241-251.

@article{article, author={Abdulhafid Modabish Et Al. }, title={Enumeration of spanning trees in a chain of diphenylene graphs}, journal={JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY}, year=2022, pages={241-251} }