Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, please contact scholcom@uwyo.edu
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the max...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
Let q (G) denote the spectral radius of the signless Laplacian matrix of a graph G, also known as th...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
This project is for students interested in applying algebra and computa-tion to an important problem...
This paper gives tight upper bounds on the largest eigenvalue q (G) of the signless Laplacian of gra...
This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been ...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the max...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
Let q (G) denote the spectral radius of the signless Laplacian matrix of a graph G, also known as th...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
This project is for students interested in applying algebra and computa-tion to an important problem...
This paper gives tight upper bounds on the largest eigenvalue q (G) of the signless Laplacian of gra...
This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been ...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the max...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...
DOI
Add to ORKG