On relation between the Kirchho index and 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.

Milovanovic Igor; Glogic Edin; Matejic Marjan M.; MILOVANOVIC EMINA

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

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2020 | Volume:5 | Issue:1 Page(s): 1-8

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

On relation between the Kirchho index and number of spanning trees of graphs

Author(s)

Milovanovic Igor | Glogic Edin | Matejic Marjan M. | MILOVANOVIC EMINA | Issue Writer Certificate

Keywords

Topological indices

Kirchhoindex

spanning tree

Abstract

Let G be a simple connected graph with degree sequence (d1; d2; : : :; dn) where = d1 d2 dn = > 0 and let 1 2 n1 > n = 0 be the Laplacian eigenvalues of G. Let Kf(G) = n Pn1 i=1 1 i and (G) = Qn1 i=1 i denote the Kirchho index and the number of spanning trees of G, respectively. In this paper we establish several lower bounds for Kf(G) in terms of (G), the order, the size and maximum degree of G.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Milovanovic, Igor, Glogic, Edin, Matejic, Marjan M., & MILOVANOVIC, EMINA. (2020). On relation between the Kirchho index and number of spanning trees of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 5(1), 1-8. SID. https://sid.ir/paper/702984/en

Vancouver: Copy

Milovanovic Igor, Glogic Edin, Matejic Marjan M., MILOVANOVIC EMINA. On relation between the Kirchho index and number of spanning trees of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2020;5(1):1-8. Available from: https://sid.ir/paper/702984/en

IEEE: Copy

Igor Milovanovic, Edin Glogic, Marjan M. Matejic, and EMINA MILOVANOVIC, “On relation between the Kirchho index and number of spanning trees of graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 5, no. 1, pp. 1–8, 2020, [Online]. Available: https://sid.ir/paper/702984/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops