Effect on normalized graph Laplacian spectrum by motif attachment and duplication

DOI10.1016/j.amc.2015.03.118zbMath1410.05136arXiv1210.5125OpenAlexW2089453317MaRDI QIDQ1643317

Ranjit Mehatari, Anirban Banerjee

Publication date: 19 June 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.5125

zbMATH Keywords

graph spectrumeigenvalue 1motif doublingmotif attachmentnormalized graph Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalue problems for linear operators (47A75)

Related Items

An eigenvalue localization theorem for stochastic matrices and its application to Randić matrices, On the adjacency matrix of a complex unit gain graph, Systematic evaluation of a new combinatorial curvature for complex networks, Independence number and the normalized Laplacian eigenvalue one, Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating, The normalized Laplacian spectrum of n -polygon graphs and applications, Characteristics polynomial of normalized Laplacian for trees, On the spectrum of the normalized Laplacian of iterated triangulations of graphs, On the normalized spectrum of threshold graphs, Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs, The behavior of Tutte polynomials of graphs under five graph operations and its applications, Spectral analysis for weighted iterated q-triangulation networks, SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS

Cites Work

• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the spectrum of the normalized graph Laplacian
• Graph spectra as a systematic tool in computational biology
• Laplacian matrices of graphs: A survey
• Collective dynamics of ‘small-world’ networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item