COUNTING THE NUMBER OF SPANNING TREES OF GRAPHS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GHORBANI M.; BANI ASADI E.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2013 | Volume:4 | Issue:1 Page(s): 111-121

Download Full-Text

Persian Verion

View:

6,166

Download:

366

Cites:

Information Journal Paper

Title

COUNTING THE NUMBER OF SPANNING TREES OF GRAPHS

Author(s)

GHORBANI M. | BANI ASADI E. | Issue Writer Certificate

Keywords

SPANNING TREEQ2

LAPLACIAN EIGENVALUEQ2

FULLERENEQ3

Abstract

A SPANNING TREE of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m=n, n + 1, n + 2, n + 3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of FULLERENE graphs.

Cites

No record.

References

No record.

Cite

APA: Copy

GHORBANI, M., & BANI ASADI, E.. (2013). COUNTING THE NUMBER OF SPANNING TREES OF GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 4(1), 111-121. SID. https://sid.ir/paper/205632/en

Vancouver: Copy

GHORBANI M., BANI ASADI E.. COUNTING THE NUMBER OF SPANNING TREES OF GRAPHS. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY[Internet]. 2013;4(1):111-121. Available from: https://sid.ir/paper/205632/en

IEEE: Copy

M. GHORBANI, and E. BANI ASADI, “COUNTING THE NUMBER OF SPANNING TREES OF GRAPHS,” IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, vol. 4, no. 1, pp. 111–121, 2013, [Online]. Available: https://sid.ir/paper/205632/en

Related Journal Papers