ComputingComputer ScienceCircuit TheoryComputer NetworksGraph VisualizationEigenvalue ProblemsGraph AlgorithmsGraph TheoryEigenvalues Of The LaplacianGraph Laplacian
Let G be a graph of order n. Let ?1 , ?2 , . . . , ?n be the eigenvalues of the adjacency matrix of G, and let ?1 , ?2 , . . . , ?n be the eigenvalues of the Laplacian matrix of G. Much studied Estrada index of the graph G is defined n as EE = EE(G)= ?n/i=1 e?i . We define and investigate the Laplacian Estrada index of the graph G, LEE=LEE(G)= ?n/i=1 e(?i - 2m/n). Bounds for LEE are obtained, as well as some relations between LEE and graph Laplacian energy.
7
Subgraph centrality in complex networks
Ernesto Estrada, Juan A. Rodríguez‐Velázquez · Physical Review E · 2005 · 1.3K citations · Full text
İvan Gutman, Bo Zhou · Linear Algebra and its Applications · 2005 · 491 citations
Spectral measures of bipartivity in complex networks
Ernesto Estrada, Juan A. Rodríguez‐Velázquez · Physical Review E · 2005 · 242 citations · Full text