Displaying similar documents to “Eigenvalues and weights of induced subgraphs.”

Bounds for index of a modified graph

Bo Zhou (2004)

Discussiones Mathematicae Graph Theory

Similarity:

If a graph is connected then the largest eigenvalue (i.e., index) generally changes (decreases or increases) if some local modifications are performed. In this paper two types of modifications are considered: (i) for a fixed vertex, t edges incident with it are deleted, while s new edges incident with it are inserted; (ii) for two non-adjacent vertices, t edges incident with one vertex are deleted, while s new edges incident with the other vertex are...

Near threshold graphs.

Kirkland, Steve (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity: