Spectral Recognition of Graphs
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Partitions of networks that are robust to vertex permutation dynamics”
Spectral Recognition of Graphs
ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS
Lihua Feng, Guihai Yu (2009)
Publications de l'Institut Mathématique
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.
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.
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:
On connected graphs with maximal index.
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
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.
Matrix and discrepancy view of generalized random and quasirandom graphs
Marianna Bolla, Ahmed Elbanna (2016)
Special Matrices
Similarity:
We will discuss how graph based matrices are capable to find classification of the graph vertices with small within- and between-cluster discrepancies. The structural eigenvalues together with the corresponding spectral subspaces of the normalized modularity matrix are used to find a block-structure in the graph. The notions are extended to rectangular arrays of nonnegative entries and to directed graphs. We also investigate relations between spectral properties, multiway discrepancies,...
On graphs whose spectral spread does not exceed 4.
Petrović, Miroslav M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The inertia of unicyclic graphs and bicyclic graphs
Ying Liu (2013)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n₊,n₋,n₀) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n₀ denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n - 2ν(G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number...
Signless Laplacians and line graphs
D. Cvetković (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Non-complete extended -sum of graphs, graph angles and star partitions.
Cvetković, Dragoš, Simić, Slobodan (1993)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Spectral characterization of multicone graphs
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....