enumeration of the number of spanning trees in some ... - Toubkal
enumeration of the number of spanning trees in some ... - Toubkal
enumeration of the number of spanning trees in some ... - Toubkal
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
138 BIBLIOGRAPHY[46] P. Erdös, and A. Rényi, On a Problem <strong>in</strong> <strong>the</strong> Theory <strong>of</strong> Graphs, Publ.Math.Inst.Hungar.Acad.Sci. 7 (1962), 623 - 641.[47] M. Essalih, M. El Marraki, and G.Alhagri, Calculation <strong>of</strong> <strong>some</strong> topological<strong>in</strong>dices <strong>of</strong> graphs, Journal <strong>of</strong> Theoretical and Applied Information Technology(JATIT), Vol. 30 No.2 (2011), 122 - 127.[48] M. Fiedler, Algebraic Connectivity <strong>of</strong> Graphs, Czechoslovak Ma<strong>the</strong>matical Journal,23 (1973), 298 - 305.[49] W. Feussner, Zur Berechnung der Stromsträrke <strong>in</strong> netzförmigen Letern, Ann.Phys., 15 (1904), 385 - 394.[50] B. Gilbert, W. Myrvold, Maximiz<strong>in</strong>g <strong>spann<strong>in</strong>g</strong> <strong>trees</strong> <strong>in</strong> almost complete graphs,Networks 30 (1997), 97 - 104.[51] I. P. Goulden and D.M. Jackson, Comb<strong>in</strong>atorial Enumeration, John Wiley &Sons Inc., New York, 1983.[52] R. Grone and R. Merris, The Laplacian Spectrum <strong>of</strong> a Graph II, SIAM Journalon discrete Ma<strong>the</strong>matics 7 (1994) 221 - 229.[53] R. Grone, R. Merris and V. S. Sunder, The Laplacian Spectrum <strong>of</strong> a Graph,SIAM Journal on Matrix Analysis and its Applications 11 (1990) 218 - 238.[54] I. Gutman, Y. N. Yeh, S. L. Lee and J. C. Chen, Wiener <strong>number</strong>s <strong>of</strong> dendrimers,MATCH (Commun. Math. Comput. Chem) 30 (1994), pp. 103 - 115.[55] P. L. Hammer, A. K. Kel’mans, Laplacian Spectra and Spann<strong>in</strong>g Trees <strong>of</strong> ThresholdGraphs, Discrete Applied Ma<strong>the</strong>matics 65 (1996) 255 - 273.[56] F. Harary, Graph <strong>the</strong>ory, Addison-Wesley, Read<strong>in</strong>g, MA, 1969.[57] J. M. Harris, J. L. Hirst, and M. J. Moss<strong>in</strong>gh<strong>of</strong>f, Comb<strong>in</strong>atorics and GraphTheory, Spr<strong>in</strong>ger, 2008.[58] S. Janson, The Wiener <strong>in</strong>dex <strong>of</strong> simply generated random <strong>trees</strong>, Random Struct.Alg. 22 (2003), no. 4, 337 - 358.[59] S. Janson, T. Luczak and A. Ruciński, Random Graphs, Wiley and Sons, NewYork 2000.[60] A. K. Kel’mans, Comparison <strong>of</strong> graphs by <strong>the</strong>ir <strong>number</strong> <strong>of</strong> <strong>spann<strong>in</strong>g</strong> <strong>trees</strong>, DiscreteMa<strong>the</strong>matics, 16 (3) (1976), 241 - 261.[61] A. K. Kel’mans, Spann<strong>in</strong>g <strong>trees</strong> <strong>of</strong> extended graphs, Comb<strong>in</strong>atorica, 12 (1) (1992),45 - 51.
Change language