S. Pati

The Spectrum of the Corona of Two Graphs

We consider only simple graphs. Given two graphs

Algebraic connectivity and the characteristic set of a graph

G

Minimizing algebraic connectivity over connected graphs with fixed girth

with vertices

On nonsingular trees and a reciprocal eigenvalue property

1,\ldots,n

Maximizing Algebraic Connectivity Over Unicyclic Graphs

and

The perturbed laplacian matrix of a graph

H

On graphs with algebraic connectivity equal to minimum edge density

, the corona

Laplacian Spectrum of Weakly Quasi-threshold Graphs

G\circ H

UNICYCLIC GRAPHS WITH THE STRONG RECIPROCAL EIGENVALUE PROPERTY

is defined as the graph obtained by taking

On algebraic connectivity of graphs with at most two points of articulation in each block

n