The Laplacian eigenvalue 2 of bicyclic graphs

arXiv1909.06578MaRDI QIDQ6325295FDOQ6325295

M. Habibi, Doost Ali Mojdeh, Masoumeh Farkhondeh

Publication date: 14 September 2019

Abstract: If

G

is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs

G_{1}

and

G_{2}

is a graph

G = G_{1} o d o t G_{2}

with

V (G) = V (G_{1}) c u p V (G_{2})

and

E (G) = E (G_{1}) c u p E (G_{2}) c u p e = u v

where

u i n V (G_{1})

and

v i n V (G_{2})

. In this paper, we consider the eigenvector of unicycle graphs. We study the relationship between the Laplacian eigenvalue

2

of unicyclic graphs

G_{1}

and

G_{2}

; and bicyclic graphs

G = G_{1} o d o t G_{2}

. We also characterize the broken sun graphs and the one edge connection of two broken sun graphs by their Laplacian eigenvalue

2

.

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18)

This page was built for publication: The Laplacian eigenvalue 2 of bicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325295)