On (k+1)-line graphs of k-trees and their nullities
From MaRDI portal
Recommendations
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Corrigendum to: ``On the signless Laplacian spectra of \(k\)-trees
- Graph families with constant distance determinant
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Integral trees with given nullity
- Linear time algorithm to check the singularity of block graphs
- More about singular line graphs of trees
- Nullity of graphs
- On the nullity of bipartite graphs
- On the nullity of graphs with pendent vertices
- On the nullity of line graphs of trees
- On the trees with maximum nullity
- Perfect k‐line graphs and k‐total graphs
- Subclasses of \(k\)-trees: characterization and recognition
- The number of labeled k-dimensional trees
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- Trees with maximum nullity
- TWO THEOREMS IN GRAPH THEORY
Cited in
(4)
This page was built for publication: On \((k+1)\)-line graphs of \(k\)-trees and their nullities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229485)