文献
J-GLOBAL ID:202202261986569572
整理番号:22A1099944
ジフェニレングラフの鎖におけるスパンニング木の数え上げ【JST・京大機械翻訳】
Enumeration of spanning trees in a chain of diphenylene graphs
著者 (7件):
Modabish Abdulhafid
(Department of Mathematics, Faculty of Science, Sana’a University, Yemen E-mail:)
,
Husin Mohamad Nazri
(Special Interest Group on Modelling & Data Analytics (SIGMDA), Faculty of Oceavnn Engineering Technology & Informatics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia)
,
Alameri Abdu Qaid
(Department of Biomedical Engineering, University of Science and Technology, Sana’a, Yemen E-mail:)
,
Ahmed Hanan
(Department of Mathematics, Yuvarajas College, University of Mysore, Mysore 570005, Karnataka, India E-mail:)
,
Alaeiyan Mehdi
(Department of Mathematics, Iran University of Science and Technology, Narmak, Iran E-mail:)
,
Farahani Mohammed Reza
(Department of Mathematics, Iran University of Science and Technology, Narmak, Iran E-mail:)
,
Cancan Murat
(Faculty of Education, Van Yuezuencue Yil University, Van 65090, Turkey E-mail:)
資料名:
Journal of discrete mathematical Sciences and Cryptography
(Journal of discrete mathematical Sciences and Cryptography)
巻:
25
号:
1
ページ:
241-251
発行年:
2022年
JST資料番号:
W5947A
ISSN:
0972-0529
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
イギリス (GBR)
言語:
英語 (EN)