Further results on the star degree of graphs
From MaRDI portal
Publication:2139789
Recommendations
- Permanental roots and the star degree of a graph
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Signless Laplacians of finite graphs
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
Cites work
- Computing the permanental polynomials of graphs
- Highly unique network descriptors based on the roots of the permanental polynomial
- Matching theory
- Multiplicity of integer roots of polynomials of graphs
- On the (signless) Laplacian permanental polynomials of graphs
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Permanental roots and the star degree of a graph
- The coefficients of the immanantal polynomial
- The complexity of computing the permanent
Cited in
(6)- Permanental roots and the star degree of a graph
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- Some unicyclic graphs determined by the signless Laplacian permanental polynomial
- On the roots of (signless) Laplacian permanental polynomials of graphs
- Ambarzumyan-type theorems on star graphs
- scientific article; zbMATH DE number 5583535 (Why is no real title available?)
This page was built for publication: Further results on the star degree of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139789)