Towards a spectral theory of graphs based on the signless Laplacian, III
暂无分享,去创建一个
[1] Lihua Feng,et al. Minimizing the Laplacian spectral radius of trees with given matching number , 2007 .
[2] Lihua Feng,et al. ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS , 2009 .
[3] Pierre Hansen,et al. Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex , 2007, CTW.
[4] Dragoš Cvetković,et al. Towards a spectral theory of graphs based on the signless Laplacian, III , 2010 .
[5] Lihua Feng. The Signless Laplacian Spectral Radius for Bicyclic Graphs with κ Pendant Vertices , 2010 .
[6] D. Cvetkovic. Signless Laplacians and line graphs , 2005 .
[7] Kinkar Chandra Das,et al. Maximizing the sum of the squares of the degrees of a graph , 2004, Discret. Math..
[8] Slobodan K. Simić,et al. On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by −2 , 2008 .
[9] Frank Harary,et al. Graph Theory , 2016 .
[10] Kinkar Ch. Das,et al. A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs , 2004 .
[11] Yi-Zheng Fan,et al. The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices , 2009, Graphs Comb..
[12] Ping Zhu,et al. A study of graph spectra for comparing graphs and trees , 2008, Pattern Recognit..
[13] K. Tajbakhsh,et al. Starlike trees are determined by their Laplacian spectrum , 2007 .
[14] Dragoš Cvetković,et al. EIGENVALUE BOUNDS FOR THE SIGNLESS LAPLACIAN , 2007 .
[15] P. Hansen,et al. Bounds and conjectures for the signless Laplacian index of graphs , 2009 .
[16] Dariush Kiani,et al. On incidence energy of a graph , 2009 .
[17] Yi-Zheng Fan,et al. Unoriented Laplacian maximizing graphs are degree maximal , 2008 .
[18] Guihai Yu,et al. NO STARLIKE TREES ARE LAPLACIAN COSPECTRAL , 2006 .
[19] Muhuo Liu,et al. Ordering of the signless Laplacian spectral radii of unicyclic graphs , 2011, Australas. J Comb..
[20] Zoran Stanic,et al. On some forests determined by their Laplacian or signless Laplacian spectrum , 2009, Comput. Math. Appl..
[21] Bolian Liu,et al. The maximum clique and the signless Laplacian eigenvalues , 2008 .
[22] Jun Zhou,et al. Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order , 2008 .
[23] Xiao-Dong Zhang. The signless Laplacian spectral radius of graphs with given degree sequences , 2009, Discret. Appl. Math..
[24] Xiaogang Liu,et al. The lollipop graph is determined by its Q-spectrum , 2009, Discret. Math..
[25] Dragoš Cvetković,et al. A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph , 2008 .
[26] Spectra of copies of a generalized Bethe tree attached to any graph , 2009 .
[27] S. Simic,et al. On Q-integral (3,s)-semiregular bipartite graphs , 2010 .
[28] Francesco Belardo,et al. On graphs whose signless Laplacian index does not exceed 4.5 , 2009 .
[29] Zoran Stanic,et al. Q-integral graphs with edge-degrees at most five , 2008, Discret. Math..
[30] Dragan Stevanović,et al. Research problems from the Aveiro Workshop on Graph Spectra , 2007 .
[31] Guihai Yu,et al. The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints , 2009 .
[32] Muhuo Liu,et al. The signless Laplacian spread , 2010 .
[33] Wei Wang,et al. On the spectral characterization of T-shape trees , 2006 .
[34] Guihai Yu,et al. No star-like trees are Laplacian co-spectral , 2007 .
[35] Mustapha Aouchiche,et al. A survey of automated conjectures in spectral graph theory , 2009 .
[36] Amir Daneshgar,et al. Graph homomorphisms and nodal domains , 2006 .
[37] Nair Maria Maia de Abreu,et al. Bounds on the Q-spread of a graph , 2010 .
[38] D. Cvetkovic,et al. Signless Laplacians of finite graphs , 2007 .
[39] D. Cvetkovic,et al. Towards a spectral theory of graphs based on the signless Laplacian, I , 2009 .
[40] K. Das. A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix , 2009 .