Conference Paper

Improved Bounds For The Number of Spanning Trees of Graphs

Volume: 11 December 30, 2019
EN

Improved Bounds For The Number of Spanning Trees of Graphs

Abstract

For a given a simple connected graph, we present some new bounds via a new approach for the number of spanning trees. Usage this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.

Keywords

References

  1. Banchev, D., Balaban, A.T., Liu, X., Klein, D.J., {\em Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distances}, Int. J. Quantum Chem., \textbf{50}(1994), 2978--2981.
  2. Biler, P., Witkowski, A., Problems in Mathematical Analysis, New York, 1990.
  3. Bollobas, B., Erd\"{o}s, P., {\em Graphs of extremal weights}, Ars Combinatoria, \textbf{50}(1998), 225--233.
  4. Bozkurt, \c{S}.B., Bozkurt, D., {\em On the sum of powers of normalized Laplacian eigenvalues of graphs}, MATCH Commun. Math. Comput. Chem., \textbf{68}(2012), 917--930.
  5. Bozkurt, \c{S}. B., Bozkurt, D., {\em On the number of spanning trees of graphs}, The Scientific Worl Journal, \textbf{2014}(2014), Article ID 294038, 5 pages.
  6. Covers, M., Fallat, S., Kirkland, S., {\em On the normalized Laplacian energy and the general Randic index of graphs}, Linear Algebra and its Appl., \textbf{433}(2010), 172--190.
  7. Chen, H., Zhang, F., {\em Resistance distance and the normalized Laplacian spectrum}, Discrete App. Math., \textbf{155}(2007), 654--661.
  8. Chung, F.R.K., Spectral Graph Theory, CBMS Lecture Notes, Providence, 1997.

Details

Primary Language

English

Subjects

Mathematical Sciences

Journal Section

Conference Paper

Publication Date

December 30, 2019

Submission Date

August 8, 2019

Acceptance Date

December 17, 2019

Published in Issue

Year 2019 Volume: 11

APA
Kaya, E., & Maden, A. D. (2019). Improved Bounds For The Number of Spanning Trees of Graphs. Turkish Journal of Mathematics and Computer Science, 11, 31-39. https://izlik.org/JA42LX74SF
AMA
1.Kaya E, Maden AD. Improved Bounds For The Number of Spanning Trees of Graphs. TJMCS. 2019;11:31-39. https://izlik.org/JA42LX74SF
Chicago
Kaya, Ezgi, and Ayşe Dilek Maden. 2019. “Improved Bounds For The Number of Spanning Trees of Graphs”. Turkish Journal of Mathematics and Computer Science 11 (December): 31-39. https://izlik.org/JA42LX74SF.
EndNote
Kaya E, Maden AD (December 1, 2019) Improved Bounds For The Number of Spanning Trees of Graphs. Turkish Journal of Mathematics and Computer Science 11 31–39.
IEEE
[1]E. Kaya and A. D. Maden, “Improved Bounds For The Number of Spanning Trees of Graphs”, TJMCS, vol. 11, pp. 31–39, Dec. 2019, [Online]. Available: https://izlik.org/JA42LX74SF
ISNAD
Kaya, Ezgi - Maden, Ayşe Dilek. “Improved Bounds For The Number of Spanning Trees of Graphs”. Turkish Journal of Mathematics and Computer Science 11 (December 1, 2019): 31-39. https://izlik.org/JA42LX74SF.
JAMA
1.Kaya E, Maden AD. Improved Bounds For The Number of Spanning Trees of Graphs. TJMCS. 2019;11:31–39.
MLA
Kaya, Ezgi, and Ayşe Dilek Maden. “Improved Bounds For The Number of Spanning Trees of Graphs”. Turkish Journal of Mathematics and Computer Science, vol. 11, Dec. 2019, pp. 31-39, https://izlik.org/JA42LX74SF.
Vancouver
1.Ezgi Kaya, Ayşe Dilek Maden. Improved Bounds For The Number of Spanning Trees of Graphs. TJMCS [Internet]. 2019 Dec. 1;11:31-9. Available from: https://izlik.org/JA42LX74SF