Laplacian spectral characterization of (broken) dandelion graphs
From MaRDI portal
(Redirected from Publication:2221071)
Recommendations
- scientific article; zbMATH DE number 6453278
- scientific article; zbMATH DE number 6501376
- Laplacian spectral characterizations of new unicyclic graphs \(H (p,tK_{1,m})\)
- Laplacian spectral characterization of some unicyclic graphs
- Laplacian spectral characterizations of some classes of multi-cyclic graphs
Cites work
- scientific article; zbMATH DE number 6501376 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 6453278 (Why is no real title available?)
- scientific article; zbMATH DE number 6453536 (Why is no real title available?)
- A certain polynomial of a graph and graphs with an extremal number of trees
- Can One Hear the Shape of a Drum?
- Developments on spectral characterizations of graphs
- Laplacian spectral characterization of 3-rose graphs
- Laplacian spectral characterization of clover graphs
- Laplacian spectral characterization of roses
- Laplacian spectral characterizations of new unicyclic graphs \(H (p,tK_{1,m})\)
- On the Laplacian eigenvalues of a graph
- On the spectral characterization of kite graphs
- On the spectral characterization of some unicyclic graphs
- Signless Laplacian spectral characterization of 4-rose graphs
- Signless Laplacian spectral characterization of the cones over some regular graphs
- Signless Laplacians of finite graphs
- Spectral characterizations of propeller graphs
- Spectral characterizations of sun graphs and broken sun graphs
- Spectral characterizations of the corona of a cycle and two isolated vertices
- Spectral determination of some chemical graphs
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- The Sun graph is determined by its signless Laplacian spectrum
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- The lollipop graph is determined by its Q-spectrum
- The lollipop graph is determined by its spectrum
- The spectral characterization of butterfly-like graphs
- Which graphs are determined by their spectrum?
Cited in
(3)
This page was built for publication: Laplacian spectral characterization of (broken) dandelion graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221071)
