TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I
Dragoš Cvetković, Slobodan K. Simić (2009)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković, Slobodan K. Simić (2009)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković (2009)
Zbornik Radova
Similarity:
Dragoš Cvetković (2011)
Zbornik Radova
Similarity:
Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)
Czechoslovak Mathematical Journal
Similarity:
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph....
Li Su, Hong-Hai Li, Jing Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.
Lihua Feng, Guihai Yu (2009)
Publications de l'Institut Mathématique
Similarity:
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Wang, Jianfeng, Belardo, Francesco, Huang, Qiongxiang, Marzi, Enzo M.Li (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Gary Froyland, Eric Kwok (2015)
Special Matrices
Similarity:
Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem. In this paper we generalise the standard balanced bisection problem for static graphs to a new “dynamic balanced bisection problem”, in which the bisecting cut should be minimal when the vertex-labelled graph is subjected to a general sequence...
D. Cvetković (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity: