Add to ORKGSIGLETIB Hannover: RN 5999(6) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
10.1016/j.jcta.2009.10.002Journal of Combinatorial Theory. Series A1173289-312JCBT
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractIn this note, by proving some combinatorial identities, we obtain a simple form for the eige...
SIGLEAvailable from TIB Hannover: RN4052(92752) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - T...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
AbstractIn this paper we present some questions and answers about the set of eigenvalues of graphs. ...
SIGLETIB: RO 1945 (24) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
This item was digitized from a paper original and/or a microfilm copy. If you need higher-resolution...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
10.1016/j.jcta.2009.10.002Journal of Combinatorial Theory. Series A1173289-312JCBT
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractIn this note, by proving some combinatorial identities, we obtain a simple form for the eige...
SIGLEAvailable from TIB Hannover: RN4052(92752) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - T...
Let G be a graph with n vertices, 1 (G) n (G) be the eigenvalues of its adjacency matrix, ...
AbstractIn this paper we present some questions and answers about the set of eigenvalues of graphs. ...
SIGLETIB: RO 1945 (24) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...
This item was digitized from a paper original and/or a microfilm copy. If you need higher-resolution...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractWe compute the eigenvalues of the complete multipartite graph and present some applications ...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...