The multiplicity of the Laplacian eigenvalue 2 in some bicyclic graphs

arXiv1904.12299MaRDI QIDQ6317873FDOQ6317873

Authors: Masoumeh Farkhondeh, M. Habibi, Dost Ali Mojdeh, Yongsheng Rao

Publication date: 28 April 2019

Abstract: The Laplacian matrix of a graph

G

is denoted by

L (G) = D (G) - A (G)

, where

D (G) = d i a g (d (v_{1}), l d o t s, d (v_{n}))

is a diagonal matrix and

A (G)

is the adjacency matrix of

G

. Let

G_{1}

and

G_{2}

be two graphs. A one-edge connection of two graphs

G_{1}

and

G_{2}

is a graph

G = G_{1} o d o t_{u v} 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})

. We investigate the multiplicity of the Laplacian eigenvalue

2

of

G_{1} o d o t_{u v} G_{2}

, while the unicyclic graphs

G_{1}

and

G_{2}

have

2

among their Laplacian eigenvalues, by using their Laplacian characteristic polynomials. Some structural conditions ensuring the presence of the existence

2

in the

G = G_{1} o d o t_{u v} G_{2}

where both

G_{1}

and

G_{2}

have

2

as Laplacian eigenvalue, have been investigated, while, here we study the existence Laplacian eigenvalue

2

in

G = G_{1} o d o t_{u v} G_{2}

where at most one of

G_{1}

or

G_{2}

has

2

as Laplacian eigenvalue.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Polynomials in number theory (11C08)

This page was built for publication: The multiplicity of the Laplacian eigenvalue $2$ in some bicyclic graphs

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