Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Some Bicyclic Graphs Having 2 as Their Laplacian Eigenvalues
View through CrossRef
If G is a graph, its Laplacian is the difference between the 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 ⊙ u v G 2 with V ( G ) = V ( G 1 ) ∪ V ( G 2 ) and E ( G ) = E ( G 1 ) ∪ E ( G 2 ) ∪ { e = u v } where u ∈ V ( G 1 ) and v ∈ V ( G 2 ) . In this paper, we study some structural conditions ensuring the presence of 2 in the Laplacian spectrum of bicyclic graphs of type G 1 ⊙ u v G 2 . We also provide a condition under which a bicyclic graph with a perfect matching has a Laplacian eigenvalue 2. Moreover, we characterize the broken sun graphs and the one-edge connection of two broken sun graphs by their Laplacian eigenvalue 2.
Title: Some Bicyclic Graphs Having 2 as Their Laplacian Eigenvalues
Description:
If G is a graph, its Laplacian is the difference between the 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 ⊙ u v G 2 with V ( G ) = V ( G 1 ) ∪ V ( G 2 ) and E ( G ) = E ( G 1 ) ∪ E ( G 2 ) ∪ { e = u v } where u ∈ V ( G 1 ) and v ∈ V ( G 2 ) .
In this paper, we study some structural conditions ensuring the presence of 2 in the Laplacian spectrum of bicyclic graphs of type G 1 ⊙ u v G 2 .
We also provide a condition under which a bicyclic graph with a perfect matching has a Laplacian eigenvalue 2.
Moreover, we characterize the broken sun graphs and the one-edge connection of two broken sun graphs by their Laplacian eigenvalue 2.
Related Results
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Bio-based polyesters from cyclic monomers derived from carbohydrates
Bio-based polyesters from cyclic monomers derived from carbohydrates
Polyesters are extremely versatile polymers which can be used in a wide variety of applications ranging from high performance materials to recyclable and degradable polymers. The p...
The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formul...
Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
The eigenvalues of the normalized Laplacian matrix of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we study ...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
On Laplacian Commutativity of Graphs
On Laplacian Commutativity of Graphs
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs. Two graphs are Laplacian commutative if their Laplacian matrices commute. ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...