Beranda Pencarian The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph <math display='inline' xmlns='http://www.w3.org/1998/Math/MathML'> <mrow> <msub> <mi>K</mi> <mrow> <mn>1</mn><mo>,</mo><mi>s</mi><mo>,</mo><mi>t</mi></mrow> </msub> </mrow></math>

CrossRef Open Access 2025

The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph <math display='inline' xmlns='http://www.w3.org/1998/Math/MathML'> <mrow> <msub> <mi>K</mi> <mrow> <mn>1</mn><mo>,</mo><mi>s</mi><mo>,</mo><mi>t</mi></mrow> </msub> </mrow></math>

Yangguang Ma

Lihat Sumber DOI

Penulis (1)

Yangguang Ma

Format Sitasi

APA MLA BibTeX

Ma, Y. (2025). The Matching Polynomial of the Path-Tree of the Complete Tripartite Graph <math display='inline' xmlns='http://www.w3.org/1998/Math/MathML'> <mrow> <msub> <mi>K</mi> <mrow> <mn>1</mn><mo>,</mo><mi>s</mi><mo>,</mo><mi>t</mi></mrow> </msub> </mrow></math>. https://doi.org/10.4236/am.2025.167030

Akses Cepat

Lihat di Sumber doi.org/10.4236/am.2025.167030

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: CrossRef
DOI: 10.4236/am.2025.167030
Akses: Open Access ✓