A propeller graph is obtained from an ∞-graph by attaching a path to the vertex of degree four, where an ∞-graph consists of two cycles with precisely one common vertex. In this paper, it is proved that all propeller graphs are determined by their Laplacian spectra as well as their signless Laplacian spectra
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for tw...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
A propeller graph is obtained from an ∞-graph by attaching a path to the vertex of degree four, wher...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
AbstractThe wheel graph, denoted by Wn+1, is the graph obtained from the circuit Cn with n vertices ...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
Let W(n;q,m1,m2) be the unicyclic graph with n vertices obtained by attaching two paths of lengths m...
The wheel graph, denoted by Wn+1, is the graph obtained from the circuit C-n with n vertices by addi...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Let Pn and Cn denote the path and cycle on n vertices respectively. The dumbbell graph, denoted by D...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for tw...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
A propeller graph is obtained from an ∞-graph by attaching a path to the vertex of degree four, wher...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
AbstractThe wheel graph, denoted by Wn+1, is the graph obtained from the circuit Cn with n vertices ...
summary:Let $W_{n}=K_{1}\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the ...
Let W(n;q,m1,m2) be the unicyclic graph with n vertices obtained by attaching two paths of lengths m...
The wheel graph, denoted by Wn+1, is the graph obtained from the circuit C-n with n vertices by addi...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
AbstractA ∞-graph is a graph consisting of two cycles with just a vertex in common. We first look fo...
Let Pn and Cn denote the path and cycle on n vertices respectively. The dumbbell graph, denoted by D...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for tw...
A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with...
DOI
Add to ORKG