Author:
Nikolopoulos Stavros D.,Palios Leonidas,Papadopoulos Charis
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Atajan, T., Yong, X., Inaba, H.: An efficient approach for counting the number of spanning trees in circulant and related graphs. Discrete Math. 310, 1210–1221 (2010)
3. Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273–290 (2008)
4. Babel, L., Olariu, S.: On the structure of graphs with few P 4’s. Discrete Appl. Math. 84, 1–13 (1998)
5. Biggs, N.: Algebraic Graph Theory. Cambridge University Press, London (1974)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Trees;Basic Graph Theory;2017