The minimum spectral radius of graphs with a given clique number.
Stevanović, Dragan, Hansen, Pierre (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Displaying similar documents to “Spectral deformations of automorphic functions over graphs of groups.”
The minimum spectral radius of graphs with a given clique number.
Order unicyclic graphs according to spectral radius of unoriented laplacian matrix
Yi-Zheng Fan, Song Wu (2008)
Discussiones Mathematicae Graph Theory
Similarity:
The spectral radius of a graph is defined by that of its unoriented Laplacian matrix. In this paper, we determine the unicyclic graphs respectively with the third and the fourth largest spectral radius among all unicyclic graphs of given order.
On the Spectral Radius of Connected Graphs
Richard A. Brualdi, Ernie S. Solheid (1986)
Publications de l'Institut Mathématique
Similarity:
Automorphic Forms on Covering Groups of GL(2).
Yuval Z. Flicker (1980)
Inventiones mathematicae
Similarity:
Brieskorn Complete Intersections and Automorphic Forms.
Walter D. Neumann (1977)
Inventiones mathematicae
Similarity:
Automorphic forms
R. W. Bruggeman (1985)
Banach Center Publications
Similarity:
A spectral approach to the Kaplansky problem
Mostafa Mbekhta, Jaroslav Zemánek (2007)
Banach Center Publications
Similarity:
On the fundamental periods of automorphic forms of arithmetic type.
Goro Shimura (1990)
Inventiones mathematicae
Similarity:
Spectral Light as Sculptured Space
Irene Rousseau (2001)
Visual Mathematics
Similarity:
The signless Laplacian spectral radius of graphs with given number of cut vertices
Lin Cui, Yi-Zheng Fan (2010)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
Spectral study of alliances in graphs
Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta Almira (2007)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.